第5周YD督促训练 Ace of Aces
2016-04-03 15:00
330 查看
Description
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
Sample Output
#include <iostream>
#include<string.h>
#include<algorithm>
#include<cstdio>
using namespace std;
int main()
{
int t,n,a[1001],max1,max11,max2,max22,x;
cin>>t;
while(t--)
{
memset(a,0,sizeof(a));
max11=max22=max1=max2=0;
cin>>n;
for(int i=0; i<n; i++)
{
cin>>x;
a[x]++;
}
for(int i=0; i<1001; i++)
{
if(max1<a[i])
{
max1=a[i];
max11=i;
}
if(max2<=a[i])
{
max2=a[i];
max22=i;
}
}
if(max11!=max22)
cout<<"Nobody"<<endl;
else
cout<<max11<<endl;
}
return 0;
}
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
3 5 2 2 2 1 1 5 1 1 2 2 3 1 998
Sample Output
2 Nobody998
#include <iostream>
#include<string.h>
#include<algorithm>
#include<cstdio>
using namespace std;
int main()
{
int t,n,a[1001],max1,max11,max2,max22,x;
cin>>t;
while(t--)
{
memset(a,0,sizeof(a));
max11=max22=max1=max2=0;
cin>>n;
for(int i=0; i<n; i++)
{
cin>>x;
a[x]++;
}
for(int i=0; i<1001; i++)
{
if(max1<a[i])
{
max1=a[i];
max11=i;
}
if(max2<=a[i])
{
max2=a[i];
max22=i;
}
}
if(max11!=max22)
cout<<"Nobody"<<endl;
else
cout<<max11<<endl;
}
return 0;
}
#include <iostream> #include<string.h> #include<algorithm> #include<cstdio> using namespace std; int main() { int t,n,a[1001],max1,max11,max2,max22,x; cin>>t; while(t--) { memset(a,0,sizeof(a)); max11=max22=max1=max2=0; cin>>n; for(int i=0; i<n; i++) { cin>>x; a[x]++; } for(int i=0; i<1001; i++) ///顺序找到最大的下标 { if(max1<=a[i]) { max1=a[i]; max11=i; } } for(int i=1000; i>=0; i--) ///逆序找到最大的下标,而你提交错误就是因为i=1001超内存,哎,血淋淋的教训 if(max2<=a[i]) { max2=a[i]; max22=i; } if(max11!=max22) cout<<"Nobody"<<endl; else cout<<max11<<endl; } return 0; }
相关文章推荐
- 为什么总连不上--之在Windows系统下使用CLI连接Microsoft Azure 21V版本 推荐
- .NET下单文件的上传处理
- [JAVA · 初级]:15.异常处理机制
- Good-turning估计
- 动态规划之To the Max
- 女性程序员你需要注意
- 几款自带编码器的直流电机
- 排序算法
- Javascript短路表达式
- CodeForces 16B Burglar and Matches
- 消息队列MQ
- #1089 : 最短路径·二:Floyd算法
- 【笔记】 《js权威指南》- 第8章 函数 - 8.5 作为命名空间的函数 - 8.6 闭包
- Github有趣的开源项目
- 使用datagrateview控件时,显示数据库中表的信息
- Node.js中的etag包知识学习之express的配置etag
- CodeForces 15B Laser
- CentOS安装中文支持包
- Android BLE 扫描 通信
- 【Unity】协程