HDU---1004 Let the Balloon Rise【vector应用】

最新推荐文章于 2019-05-17 21:15:00 发布

Acmer之家

最新推荐文章于 2019-05-17 21:15:00 发布

阅读量204

点赞数 1

CC 4.0 BY-SA版权

分类专栏： ACM训练文章标签： ACM

本文链接：https://blog.youkuaiyun.com/potential1/article/details/77935966

ACM训练专栏收录该内容

7 篇文章

订阅专栏

这是一个关于程序设计竞赛中统计最多人气气球颜色的问题。输入包括多个测试案例，每个案例首先给出气球总数，随后列出每只气球的颜色。任务是找出出现次数最多的气球颜色。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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
   

   SOURCE:点击打开链接
   

   代码：
   
   #include <iostream>
#include <cstring>
#include <vector>
using namespace std;
int main(void)
{
    int n,maxn,maxi;
    int a[1005];
    string str;
    vector<string> v;
    while(cin>>n)
    {
        if(n==0)
            break;
        memset(a,0,sizeof(a));
        v.clear();
        maxn=-0x3f3f3f3f;
        maxi=0;
        for(int i=0; i<n; i++)
        {
            cin>>str;
            v.push_back(str);
            a[i]++;
        }
        for(int i=0; i<n-1; i++)
            for(int j=i+1; j<n; j++)
                if(v[i]==v[j])
                {
                    a[i]++;
                    a[j]++;
                }
        for(int i=0; i<n; i++)
            if(maxn<a[i])
            {
                maxn=a[i];
                maxi=i;
            }
        cout<<v[maxi]<<endl;
    }
}