*寒假水102——Ignatius and the Princess IV

最新推荐文章于 2024-07-22 15:30:00 发布

原创最新推荐文章于 2024-07-22 15:30:00 发布 · 255 阅读

0 ·

CC 4.0 BY-SA版权

2017寒假专栏收录该内容

123 篇文章

订阅专栏

本文介绍了一个算法问题，即从一组由奇数个整数组成的数据集中找到那个至少出现(N+1)/2次的特殊整数。通过记录每个整数出现的次数并找到最大次数对应的整数来解决该问题。

"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

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

#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;
}

题解：一道水题。记住输入的数出现的次数，再找出最大的就好。