Ace of Aces

最新推荐文章于 2020-06-21 20:02:55 发布

猪扒饭

最新推荐文章于 2020-06-21 20:02:55 发布

阅读量621

点赞数

分类专栏：算法文章标签：算法 zoj

本文链接：https://blog.csdn.net/wen_alan/article/details/46674535

版权

算法专栏收录该内容

6 篇文章 0 订阅

订阅专栏

http://acm.zju.edu.cn/onlinejudge/showContestProblem.do?problemId=5493

Time Limit: 2 Seconds Memory Limit: 65536 KB

There is a mysterious organization called Time-Space Administrative Bureau (TSAB) in the deep universe that we humans have not discovered yet. This year, the TSAB decided to elect an outstanding member from its elite troops. The elected guy will be honored with the title of “Ace of Aces”.

After voting, the TSAB received N valid tickets. On each ticket, there is a numberAi denoting the ID of a candidate. The candidate with the most tickets nominated will be elected as the “Ace of Aces”. If there are two or more candidates have the same number of nominations, no one will win.

Please write program to help TSAB determine who will be the “Ace of Aces”.

Input

There are multiple test cases. The first line of input contains an integer T indicating the number of test cases. For each test case:

The first line contains an integer N (1 <= N <= 1000). The next line containsN integersAi (1< =Ai <= 1000).

Output

For each test case, output the ID of the candidate who will be honored with “Ace of Aces”. If no one win the election, output “Nobody” (without quotes) instead.

Sample Input
3
5
2 2 2 1 1
5
1 1 2 2 3
1
998

Sample Output
2
Nobody
998

分析

用map进行投票计数，最后遍历取出最大票数的id号
特别的，需要对最大票数存在多个id的情况进行排除
时间复杂度O(n)

问题

有没有更好的方法来处理最大票数重复的情况？

代码

#include "stdafx.h"
#include <map>

using namespace std;

int _tmain(int argc, _TCHAR* argv[])
{
    int T;
    scanf("%d", &T);

    for (int i = 0; i < T; i++) {
        int N;
        scanf("%d", &N);

        int id;
        map<int, int> tic;
        for (int j = 0; j < N; j++) {
            scanf("%d", &id);
            if (!tic.count(id)) tic[id] = 0;
            tic[id]++;
        }

        int max = 0;
        int ace_id = 0;
        bool nobody = false;
        for (map<int, int>::iterator it = tic.begin(); it != tic.end(); ++it) {
            if (it->second == max) nobody = true;
            if (it->second > max) {
                nobody = false;
                max = it->second;
                ace_id = it->first;
            }
        }
        if (nobody)
            printf("Nobody\n");
        else
            printf("%d\n", ace_id);
    }

    return 0;
}