返回目录
#include <bits/stdc++.h>
using namespace std;
int main() {
int T;
cin>>T;
for(int t=0;t<T;t++){
map<int,int> num;//(数字,出现次数)
int n,x,c;
int s;
scanf("%d",&n);
while(n--){
scanf("%d",&x);
s=x;
if(num.find(s)==num.end())num[s]=1;
else num[s]+=1;
}
int maxx=0;
for(map<int,int>::iterator it=num.begin();it!=num.end();it++){
if(it->second>maxx){//找到出现最多的int
maxx=it->second;
s=it->first;
}
}
printf("case #%d:\n%d\n",t,maxx);
}
}