hdu 2192 MagicBuilding

#include<iostream>#include<algorithm>#include<cstring>using namespace std;int main(){int num[11000];int t;int mmax,max,cnt;int n;int i,j;cin>>t;while(t--){cin>>n;memset(num,0,sizeof(num));for(i=1;i<=n;i++){cin>>num[i];}sort(num+1,num+1+n);mmax=0;max=num[1];cnt=0;for(i=1;i<=n;i++){if(max==num[i])cnt++;else{cnt=1;max=num[i];}if(cnt>mmax){mmax=cnt;}}cout<<mmax<<endl;}return 0;}