ZOJ 3869-Ace of Aces【模拟众数】
来源:互联网 发布:淘宝京剧服装 编辑:程序博客网 时间:2024/06/01 07:11
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 number Ai 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 contains N integers Ai (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
352 2 2 1 151 1 2 2 31998
Sample Output
2Nobody998
Author: JIANG, Kai
Source: The 12th Zhejiang Provincial Collegiate Programming Contest
解题思路:
找到出现次数最多的数,如果有多个就输出Nobody。
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int map[50000];int main(){int t;scanf("%d",&t);while(t--){int n;scanf("%d",&n);memset(map,0,sizeof(map));for(int i=0;i<n;i++){int aa;scanf("%d",&aa);map[aa]++;}int max=-1;int ans;int ge=0; for(int i=1;i<=1200;i++){if(map[i]>max){max=map[i];ge=0;ans=i;}if(map[i]==max){ge++;}}if(ge>1){printf("Nobody\n");}else{printf("%d\n",ans);}}return 0;}
- ZOJ 3869-Ace of Aces【模拟众数】
- zoj 3869 Ace of Aces
- ZOJ 3869 Ace of Aces
- ZOJ-3869 Ace of Aces
- ZOJ 3869Ace of Aces
- ZOJ 3869-- Ace of Aces
- zoj-3869-Ace of Aces
- Ace of Aces ZOJ
- ZOJ Problem Set - 3869||Ace of Aces
- ZOJ - 3869 Ace of Aces (水)
- ZOJ 3869:Ace of Aces【水】
- zoj 3869 Ace of Aces (水题)
- A - Ace of Aces——ZOJ
- ZOJ 3869 Ace of Aces (The 12th Zhejiang Provincial Collegiate Programming Contest)
- Ace of Aces
- ZOJ3869 Ace of Aces
- Ace of Aces
- Ace of Aces
- HDU 3072 Intelligence System 传递的最小费用
- 网站应用架构
- memcache简介以及使用方法
- uploadFile.php
- 1015 Problem O
- ZOJ 3869-Ace of Aces【模拟众数】
- 【代码】SQL分页语句
- CSS定位机制之标准文档流
- python基础教程 re模块 学习笔记
- C++重复模板实例的处理
- 《JS权威指南》学习笔记(六):函数
- FZU 2038 Another Postman Problem【思维】
- 20.从上往下打印二叉树
- javascript高级程序设计读书笔记——Array总结