HDU 1029 Ignatius and the Prince…

Ignatius and the Princess IV

Time Limit: 2000/1000 MS (Java/Others)     Memory Limit: 65536/32767 K (Java/Others)

Total Submission(s): 6624     Accepted Submission(s): 2369

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?

 

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

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 1

 

Sample Output

3

5

1

 

Author

Ignatius.L

看到这题我真有种想鄙视杭电的感觉，题上说的那么玄乎，但是数据却弱的可怜，稍微变一下方式就过了，晕啊

其实题上说的是999999，但是由于一定有一个数据是重复了（n+1）/2次，所以最大只需开到500000（听说好像开到32796就能过 ，这垃圾数据）即可，但是提上明明没说数据的大小，用哈希存储竟然也能过，郁闷了，害的我几个月都不敢做这题

代码：

#include<stdio.h>

#include<string.h>

int map[500001];

int main()

{

int n,i,a,max;

while(scanf("%d",&n)!=EOF)

{

memset(map,0,sizeof(map));

for(i=0;i<n;i++)

{

scanf("%d",&a);

map[a]++;

if(map[a]>=(n+1)/2)

max=a;

}

printf("%d\n",max);

}

return 0;

}