<pre name="code" class="cpp">#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int main()
{
int i,n,num[3300];
while( scanf("%d",&n)!=EOF )
{
if(n==0)
{
printf("0\n");
continue;
}
for(i=0;i<n;i++)
scanf("%d",&num[i]);
sort(num,num+n);
int max=1;
int count=1;
for(i=1;i<n;i++)
{
if(num[i]>num[i-1])
count=1;
else
{
count++;
if(count>max)
max=count;
}
}
printf("%d\n",max);
}
return 0;
}
hdu 1800 Flying to the Mars
最新推荐文章于 2018-02-21 13:00:21 发布