HDU 1800 Flying to the Mars

#include<stdio.h>
#include<stdlib.h>
int a[3005];
int cmp( const void *a , const void *b )
{
return *(int *)b - *(int *)a ;
}
int main()
{
int i,n,count,max;
while(scanf("%d",&n)!=EOF)
{
for(i=0;i<n;i++)
scanf("%d",&a[i]);
qsort(a,n,sizeof(a[0]),cmp);
max = count = 1;
for(i=1;i<n;i++)
{
if(a[i-1] == a[i] )
{
count++;
if(count > max)
max = count;
continue;
}
count = 1;
}
printf("%d\n",max);
}
return 0;
}