csuoj 1390: Planting Trees

http://acm.csu.edu.cn/OnlineJudge/problem.php?id=1390
1390: Planting Trees
Time Limit: 1 Sec  Memory Limit: 128 MBSubmit: 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 }