• csuoj 1390: Planting Trees


    http://acm.csu.edu.cn/OnlineJudge/problem.php?id=1390

    1390: Planting Trees

    Time Limit: 1 Sec  Memory Limit: 128 MB
    Submit: 192  Solved: 115
    [Submit][Status][Web Board]

    Description

    Input

    Output

    Sample Input

    6
    39 38 9 35 39 20
    

    Sample Output

    42
    

    HINT

    Source

    AC代码:

     1 #include<stdio.h>
     2 #include<string.h>
     3 #include<iostream>
     4 #include<algorithm>
     5 using namespace std;
     6 
     7 bool cmp(int a, int b)
     8 {
     9     return a>b;
    10 }
    11 
    12 int main()
    13 {
    14     int n, i, k, a[100010];
    15     while(scanf("%d",&n)!=EOF)
    16     {
    17         for(i=0; i<n; i++)
    18             scanf("%d",&a[i]);
    19         sort(a, a+n, cmp);
    20         k=0;
    21         for(i=0; i<n; i++)
    22         {
    23             k=max(a[i]+i+1, k);
    24         }
    25         printf("%d
    ", k+1);
    26     }
    27     return 0;
    28 }
  • 相关阅读:
    map
    构造函数和对象
    for...in...and for each...in...
    事件
    JSON
    css伪类
    正则表达式
    什么是DOM、什么是BOM
    CSS颜色
    grid-layout实验
  • 原文地址:https://www.cnblogs.com/jeff-wgc/p/4475207.html
Copyright © 2020-2023  润新知