C语言排序(13)___众数问题(Hdu 1029)
来源:互联网 发布:微店和淘宝哪个好做 编辑:程序博客网 时间:2024/05/17 15:02
Problem Description
"OK, you are not too bad, em... But you can never pass the next test." feng5166 says.
"I will tell you an odd number N, and then N integers. There will be a special integer among them, you have to tell me which integer is the special one after I tell you all the integers." feng5166 says.
"But what is the characteristic of the special integer?" Ignatius asks.
"The integer will appear at least (N+1)/2 times. If you can't find the right integer, I will kill the Princess, and you will be my dinner, too. Hahahaha....." feng5166 says.
Can you find the special integer for Ignatius?
"I will tell you an odd number N, and then N integers. There will be a special integer among them, you have to tell me which integer is the special one after I tell you all the integers." feng5166 says.
"But what is the characteristic of the special integer?" Ignatius asks.
"The integer will appear at least (N+1)/2 times. If you can't find the right integer, I will kill the Princess, and you will be my dinner, too. Hahahaha....." feng5166 says.
Can you find the special integer for Ignatius?
Input
The input contains several test cases. Each test case contains two lines. The first line consists of an odd integer N(1<=N<=999999) which indicate the number of the integers feng5166 will tell our hero. The second line contains the N integers. The input is terminated by the end of file.
Output
For each test case, you have to output only one line which contains the special number you have found.
Sample Input
51 3 2 3 3111 1 1 1 1 5 5 5 5 5 571 1 1 1 1 1 1
Sample Output
351
题意:输入一排数,这排数满足有一个数至少出现了n/2+1次.然后输出这个数.
map的应用.
#include<iostream>#include<map>using namespace std;int main(void){ int ans,n,b; while(cin>>n) { map<int,int>a; for(int i=0;i<n;i++) { cin>>b;//用cin就超时了,超1000ms(换成scanf就375ms,,,天哪,差别有这么大么?) a[b]++; if(a[b]==(n+1)/2) { ans=b; } } cout<<ans<<endl; } return 0;}
0 0
- C语言排序(13)___众数问题(Hdu 1029)
- C语言_数学(1)___统计问题(Hdu 2563)
- C语言DFS(6)___八皇后问题(Hdu 2612)
- C语言排序(1)___水果销售
- C语言排序(3)___考试信息
- C语言排序(7)___修栅栏
- C语言排序(8)___选猴王
- C语言排序(9)___选奶牛
- C语言(23)众数问题
- 求众数(c语言)
- C语言排序(2)___'5'变空格
- C语言排序(11)___今年暑假不AC
- C语言贪心(2)___田忌赛马(Hdu 1052)
- C语言贪心(3)___最少拦截系统(Hdu 1257)
- C语言记忆化搜索___漫步校园(Hdu 1428)
- C语言动态规划(8)___雇佣工人(HDU 1158)
- C语言分治(1)___平面最近点对问题
- C语言排序问题
- MFC对数据的复制及粘贴;
- Dockerfile 最佳实践
- Struts——资源文件加载到Container
- MD5加密与验证
- php基础知识回顾
- C语言排序(13)___众数问题(Hdu 1029)
- Android 自定义View (五)
- 贪心(最大团)||dp+线段树(Codeforces Round #296 (Div. 2)D. Clique Problem)
- JAVA 异常
- HDOJ 1495 非常可乐 【BFS】
- 【C#】21. 输出Excel曲面图
- JavaScript实现判断图片是否加载完成的3种方法整理
- 将博客搬至CSDN
- SDL按键检测