hdu 1800 map水過

http://acm.hdu.edu.cn/showproblem.php?pid=1800

輸出最多重複的level個數就ok

#include<iostream><br />using namespace std;<br />#include<map><br />int a[3010];<br />int main()<br />{<br />//freopen("a.txt","r",stdin);<br />int n;<br />while(scanf("%d",&n)!=EOF)<br />{<br />int i;<br />map<int,int> m;<br />for(i=0;i<n;i++)<br />{<br />int a;<br />scanf("%d",&a);<br />m[a]++;<br />}<br />map<int,int>::iterator it;<br />int max=0;<br />for(it=m.begin();it!=m.end();it++)<br />{<br />if(it->second>max)<br />max=it->second;<br />}<br />printf("%d/n",max);<br />}<br />return 0;<br />}<br />