hdoj 1029 Ignatius and the Princess IV

Ignatius and the Princess IV

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others)
Total Submission(s): 45565 Accepted Submission(s): 20150

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

瞎胡翻译：输入一个整数n，之后一行输入n个整数，其中有一个数出现了(n+1)/2次，输出这个数。
蜜汁思路：把每个输入的数x当作下标，读入之后，a[x]++，数组a要开得够大，然后判断a[x]有没有到(n+1)/2

#include
int main()
{
	int n;
	while(scanf("%d",&n)!=EOF){
		int i;
		int a[100000]={0};
		int ans;
		for(i=0;i<n;i++){
			int x;
			scanf("%d",&x);
			a[x]++;
			if(a[x]>=(n+1)/2){
				ans=x;
			}
		}
		printf("%d\n",ans);
	}
	return 0;
 }