hdu 1800 Flying to the Mars(水的贪心)

View Code  1 #include<iostream>
 2 #include<cstdio>
 3 #include<algorithm>
 4 using namespace std;
 5 int arr[3100];
 6 int cmp(int x,int y)
 7 {
 8     return x<y;
 9 }
10 int main()
11 {
12     int n;
13     while(scanf("%d",&n)!=EOF)
14     {
15         for(int i=1;i<=n;i++)
16             scanf("%d",&arr[i]);
17         sort(arr+1,arr+1+n,cmp);
18         int temp=1,ans=1;
19         for(int i=1;i<n;i++)
20         {
21            if(arr[i]==arr[i+1])
22            {
23                temp=2;
24                for(int j=i+1;j<=n;j++)
25                    if(arr[j]==arr[j+1]&&j+1<=n)
26                        temp++;
27                    else
28                        break;
29                if(temp>ans)
30                    ans=temp;
31            }
32         }
33         printf("%d\n",ans);
34     }
35     system("pause");
36     return 0;
37