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代码：

 #include<stdio.h>
 #include<string.h>
 #include<iostream>
 #include<algorithm>
 using namespace std;

 bool cmp(int a, int b)
 {
     return a>b;
 }

 int main()
 {
     int n, i, k, a[];
     while(scanf("%d",&n)!=EOF)
     {
         for(i=; i<n; i++)
             scanf("%d",&a[i]);
         sort(a, a+n, cmp);
         k=;
         for(i=; i<n; i++)
         {
             k=max(a[i]+i+, k);
         }
         printf("%d\n", k+);
     }
     return ;
 }