hdu1029 Ignatius and the Princess IV
来源:互联网 发布:java json解析map对象 编辑:程序博客网 时间:2024/05/14 11:27
Ignatius and the Princess IV
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others)Total Submission(s): 30701 Accepted Submission(s): 13105
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
//// Created by Admin on 2017/4/4.//#include <cstdio>#include <cstring>#define MAX 10000000int a[500010];int main(){ int n,temp; while(~scanf("%d",&n)){ memset(a,0, sizeof(a)); for (int i = 0; i < n; ++i) { scanf("%d",&temp); a[temp]++; } temp=(n+1)/2; for (int j = 0; j < MAX; ++j) { if(a[j]>=temp){ printf("%d\n",j); break; } } } return 0;}/*int main(){ int n,i,j; while(scanf("%d",&n)!=EOF) { for(i=0;i<n;i++) scanf("%d",&a[i]); sort(a,a+n); j=(n+1)/2; printf("%d\n",a[j]); } return 0;} */
0 0
- HDU1029:Ignatius and the Princess IV
- hdu1029 Ignatius and the Princess IV
- hdu1029 Ignatius and the Princess IV
- HDU1029-Ignatius and the Princess IV
- hdu1029 B - Ignatius and the Princess IV
- hdu1029 Ignatius and the Princess IV
- HDU1029 Ignatius and the Princess IV
- hdu1029 Ignatius and the Princess IV 水题
- HDU1029:Ignatius and the Princess IV
- HDU1029 Ignatius and the Princess IV
- hdu1029 Ignatius and the Princess IV
- Ignatius and the Princess IV||HDU1029
- HDU1029-Ignatius and the Princess IV
- 【hdu1029 】Ignatius and the Princess IV
- HDU1029——Ignatius and the Princess IV
- HDU1029----Ignatius and the Princess IV(map实现)
- hdu1029 Ignatius and the Princess IV——多数元素
- hdu1029 Ignatius and the Princess IV(DP求数列中出现次数过半的数)
- 笔试题目笔记
- Android手机UI设计---”知乎“界面外观模仿篇(二)---在Fragment里使用自定义listview以及popupwindow弹出窗口
- 侧边栏滑动效果
- algorithm的sort排序函数
- layers-http/s
- hdu1029 Ignatius and the Princess IV
- Integer类型与int类型的==比较
- Django后台修改 admin.py
- Android退出程序三种比较优雅的方式
- hadoop大量小文件的优化策略
- Java学习路线
- java类中的方法可以创建它本身
- android Sqlite 数据库创建
- ARM 定制开发