*寒假水102——Ignatius and the Princess IV
2018-02-24 00:25
387 查看
"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?
InputThe 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.
OutputFor each test case, you have to output only one line which contains the special number you have found.
Sample Input
"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?
InputThe 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.
OutputFor each test case, you have to output only one line which contains the special number you have found.
Sample Input
5 1 3 2 3 3 11 1 1 1 1 1 5 5 5 5 5 5 7 1 1 1 1 1 1 1Sample Output
3 5 1
#include<iostream> #include<stdio.h> #include<string.h> using namespace std; int main() { int i,n,xin,max; int a[1000000],b[1000000]; while(~scanf("%d",&n)) { memset(b,0,sizeof(b)); max=0; xin=0; for(i=0;i<n;i++) { cin>>a[i]; b[a[i]]++; if(b[a[i]]>max) { max=b[a[i]]; xin=a[i]; } } cout<<xin<<endl; } return 0; }题解:一道水题。记住输入的数出现的次数,再找出最大的就好。
相关文章推荐
- Ignatius and the Princess IV ------[NWPU][2018寒假作业][通用版]一、热身 [Cloned]J题
- 【HDU】 1029 Ignatius and the Princess IV
- B - Ignatius and the Princess IV
- hdu 1029 Ignatius and the Princess IV
- Ignatius and the Princess IV HDU - 1029 (水)
- HDU1026 Ignatius and the Princess IV(java)
- hdu1029 Ignatius and the Princess IV
- 杭电 HDU 1029 Ignatius and the Princess IV
- Ignatius and the Princess IV
- dp-基础3 B - Ignatius and the Princess IV HDU - 1029
- HDOJ 1029 Ignatius and the Princess IV
- Hdu 1029 Ignatius and the Princess IV (鸽巢原理)
- hdu 1029 Ignatius and the Princess IV(主元素问题):
- 【hdu1029 】Ignatius and the Princess IV
- 杭电1029 Ignatius and the Princess IV
- Ignatius and the Princess IV
- hdu1029 Ignatius and the Princess IV
- hdu 1029 Ignatius and the Princess IV(水题)
- ACM--最少(n+1)/2--HDOJ 1029--Ignatius and the Princess IV--水
- 【算法系列学习】[kuangbin带你飞]专题十二 基础DP1 B - Ignatius and the Princess IV