hdu 1029 Ignatius and the Princess IV

题目描述

"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?

输入

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.

输出

For each test case, you have to output only one line which contains the special number you have found.

样例输入

51 3 2 3 3111 1 1 1 1 5 5 5 5 5 571 1 1 1 1 1 1

样例输出

351

题意：测试数据有多组，先给你一个n,然后是n个数，让你找这n个数中比较特殊的数，这个特殊的定义就是它出现的次数不会少于（n+1)/2的

思路：一共不就n个数，出现的次数不会少于（n+1)/2的，不就是说这个数出现次数最多

代码如下：

#include<iostream>#include<cstdio>#include<cstring>#define N 100010int a[N];using namespace std;int main(){  int n,Max,i,b,j,m;  while(scanf("%d",&n)!=EOF)  {      memset(a,0,sizeof(a));      m=0;      for(i=1;i<=n;i++)      {        scanf("%d",&b);        if(b>m)            m=b;           //记录最大的数        a[b]++;      }      Max=0;      j=0;      for(i=0;i<=m;i++)        {          if(Max<a[i])          {            Max=a[i];            j=i;          }            }      cout<<j<<endl;}}