杭电acm 5038 Grade（桶排序）

最新推荐文章于 2022-06-14 14:36:24 发布

寒萧北决风

最新推荐文章于 2022-06-14 14:36:24 发布

阅读量519

点赞数 1

分类专栏：杭电acm 文章标签：杭电acm 5038 Grade桶排序

本文链接：https://blog.csdn.net/qq_37164003/article/details/72568900

版权

杭电acm 专栏收录该内容

88 篇文章 1 订阅

订阅专栏

Grade
Time Limit: 3000/1500 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 2772 Accepted Submission(s): 1034

Problem Description
Ted is a employee of Always Cook Mushroom (ACM). His boss Matt gives him a pack of mushrooms and ask him to grade each mushroom according to its weight. Suppose the weight of a mushroom is w, then it’s grade s is

s = 10000 - (100 - w)^2

What’s more, Ted also has to report the mode of the grade of these mushrooms. The mode is the value that appears most often. Mode may not be unique. If not all the value are the same but the frequencies of them are the same, there is no mode.

Input
The first line of the input contains an integer T, denoting the number of testcases. Then T test cases follow.

The first line of each test cases contains one integers N (1<=N<=10^6),denoting the number of the mushroom.

The second line contains N integers, denoting the weight of each mushroom. The weight is greater than 0, and less than 200.

Output
For each test case, output 2 lines.

The first line contains "Case #x:", where x is the case number (starting from 1)

The second line contains the mode of the grade of the given mushrooms. If there exists multiple modes, output them in ascending order. If there exists no mode, output “Bad Mushroom”.

Sample Input

3
6
100 100 100 99 98 101
6
100 100 100 99 99 101
6
100 100 98 99 99 97

Sample Output

Case #1:
10000
Case #2:
Bad Mushroom
Case #3:
9999 10000

Source

2014 ACM/ICPC Asia Regional Beijing Online

想法：

首先想到0<=w<=200所以(100 - w）的绝对值小于110，大于等于0.

然后我们的统计它们出现次数并要要排序

所以很容易想到桶排序（注意输入数据可以是10的6次方，数组开的大些）。

代码：

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int a[1000010];
int b[110];
int main()
{
    int N;
    scanf("%d",&N);
    int z=1;
    while(N--)
    {
     int i,j,n;
     memset(b,0,sizeof(b));
     scanf("%d",&n);
     for(i=0;i<n;i++)
     {
         scanf("%d",&a[i]);
         a[i]=abs(a[i]-100);
         b[a[i]]++;
    }
    int maxx=0;
    for(i=0;i<110;i++)
    {
        if(b[i]>maxx)
            maxx=b[i];
    }
    int count=0;
    for(i=0;i<110;i++)
    {
        if(b[i]==maxx)
            count++;
    }
     printf("Case #%d:\n",z++);
    if(count*maxx==n&&count!=1)
    {
        printf("Bad Mushroom\n");
    }
    else
    {
        int flag=0;
        for(i=109;i>=0;i--)
        {
            if(b[i]==maxx&&flag==0)
               {
                 printf("%d",10000 - (i*i));
                 flag=1;
               }
            else
            if(b[i]==maxx&&flag==1)
             {
                 printf(" %d",10000 -( i*i));
            }
        }
        printf("\n");
    }
    }
    return 0;
}