HDU 1004 Let the Balloon Rise

Let the Balloon Rise

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 30662    Accepted Submission(s): 10048

Problem Description

Contest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is guessing the most popular problem. When the contest is over, they will count the balloons of each color and find the result.

This year, they decide to leave this lovely job to you.

 

 

Input

Input contains multiple test cases. Each test case starts with a number N (0 < N <= 1000) -- the total number of balloons distributed. The next N lines contain one color each. The color of a balloon is a string of up to 15 lower-case letters.

A test case with N = 0 terminates the input and this test case is not to be processed.

 

 

Output

For each case, print the color of balloon for the most popular problem on a single line. It is guaranteed that there is a unique solution for each test case.

 

 

Sample Input

5 green red blue red red 3 pink orange pink 0

 

 

Sample Output

red pink

 

 

Author

WU, Jiazhi

 

 

Source

ZJCPC2004

 

 

Recommend

JGShining

 

 

 

 

我当时做是这样的，把字符串按字典排序。然后用count[],str[].号码对应，分别是count[]某字符串的个数和str[]保存该字符串。然后找count[]中最大数对应的号码，再从号码中找那个串。

 

 

后来看会自己的代码，发现还挺复杂的。人家的报告用STL才几行就OK了。

所以一定要学习下STL

我的代码：

#include<stdio.h>
#include<string.h>
#define maxn 1010
char c[maxn][20];
int main()
{
    int n, i, j,k,max,count[maxn];
    char jh[20],str[maxn][20];
    while(scanf("%d",&n) == 1 && n)
    {
        getchar();
        for(i = 0;i < n;i++)
        {
            gets(c[i]);
        }
        for(i = 0;i < n - 1; i++)//排序，看！当时连快排都不会。
        {
            for(j = 0;j < n - 1 - i;j++)
            {
                if(strcmp(c[j],c[j + 1]) < 0)
                {
                    strcpy(jh,c[j]);
                    strcpy(c[j],c[j + 1]);
                    strcpy(c[j + 1],jh);
                }
            }
        }
        memset(count,0,sizeof(count));
        count[0] = 1;
        strcpy(str[0],c[0]);
        k = 0;
        for(i = 1;i < n;i++)//计算每个串的个数。
        {
            if (strcmp(c[i],c[i - 1]) == 0)
            {
                count[k]++;
            }
            else
            {
                strcpy(str[++k],c[i]);
                count[k]++;
            }
        }
        max = 0;
        for(i = 1;i <= k;i++)//找个数最多的串对应的号码。
        {
            if(count[max] < count[i])
            {
                max = i;
            }
        }
        puts(str[max]);
    }
    return 0;
}

人家STL的代码：

#include<stdio.h>
#include<string>
#include<iostream>
#include<map>
using namespace std;
const int MAXN=1000;

int main()
{
    map<string,int>color;
    string cnt;
    string index;
    int i;
    int n;
    int max;
    while(scanf("%d",&n),n)
    {
        max=0;
        for(i=0;i<n;i++)
        {
            cin>>cnt;
            color[cnt]++;
            if(color[cnt]>max)
            {
                index=cnt;max=color[cnt];
            }
                
        }
        cout<<index<<endl;
        
        
    } 
    return 0;   
}