• Let the Balloon Rise(水)


    题目连接:http://acm.hdu.edu.cn/showproblem.php?pid=1004

    Let the Balloon Rise

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


    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
    联系map的用法
     1 #include<cstdio>
     2 #include<cstring>
     3 #include<string>
     4 #include<map>
     5 #include<iostream>
     6 using namespace std;
     7 #define N 1010
     8 map <string,int> mp;
     9 struct MAX {
    10     int a;
    11     string color;
    12 };
    13 int main()
    14 {
    15     int n;
    16     while(~scanf("%d",&n),n)
    17     {
    18         mp.clear();
    19         for(int i =0 ;i < n ;i++)
    20         {
    21             char ss[20];
    22             scanf("%s",ss);
    23             string s = ss;
    24             if(mp.find(ss)==mp.end()) mp[s] = 1;
    25             else mp[s]++;
    26         }
    27         MAX mx;
    28         int sum = 0 ;
    29         map <string , int >:: iterator it;
    30         for( it = mp.begin(); it!=mp.end(); it++)
    31         {
    32             if(sum<(*it).second)
    33             {
    34                 sum = (*it).second;
    35                 mx.a = sum;
    36                 mx.color = (*it).first;
    37             }
    38         }
    39         printf("%s
    ",mx.color.c_str());
    40     }
    41     return 0;
    42 }
  • 相关阅读:
    HDU 1874 畅通工程续
    HDU 1232 畅通工程
    HDU 1233 还是畅通工程
    HDU 1269 迷宫城堡
    洛谷 P1078 文化之旅
    POJ 3461 Oulipo
    最长链
    矩形面积求并
    有趣的数
    修复公路
  • 原文地址:https://www.cnblogs.com/shanyr/p/4724526.html
Copyright © 2020-2023  润新知