#include<iostream>
#include<cstdio>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
int a[1000005];
int t, n, w,s;
scanf("%d",&t);
for (int i = 0; i < t; i++)
{
scanf("%d", &n);
int maxcount = 0, count = 0;//maxcount表示grade出现次数的最大值 count表示有几个grade
int maxgrade = 0, mingrade = 10000;
memset(a, 0, sizeof(a));
for (int j = 0; j < n; j++)
{
scanf("%d",&w);
s = 10000 - (100 - w)*(100 - w);
if (s < mingrade)
{
mingrade = s;//找出最小grade
}
if (s>maxgrade)
{
maxgrade = s;//找出最大grade
}
if (!a[s])
{
count++;
}
a[s]++;
if (a[s] > maxcount)
{
maxcount = a[s];
}
}
printf("Case #%d:\n", i +1);
if (maxcount*count == n&&count > 1)
{
cout << "Bad Mushroom" << endl;
}
else
{
int p = 0;
for (int j = mingrade; j <= maxgrade; j++)
{
if (a[j] == maxcount)
{
if (p)
{
cout << " ";
}
cout << j;
p = 1;
}
}
cout << endl;
}
}
return 0;
}
cin cout会造成超时 直接用scanf输入
hdu-5038 蘑菇grade问题
猜你喜欢
转载自blog.csdn.net/cjava__/article/details/81091186
今日推荐
周排行