HDU - 1029 Ignatius and the Princess IV

DP动态规划水题，小技巧

describe

“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.

样例：
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
结果：
3
5
1

题意就是输入一个奇数N，下一行给出N个数， 有一个数至少存在(N+1)/2个，很水吧。。。。但是三种方法，第三个最优。
下面看一下第一种严重浪费空间，非常无脑的方案。

#include<stdio.h>
int aa[1000000];
int main()
{
	long n,t,re;
	while(scanf("%d",&n)!=EOF)
	{
		for(int i=0;i<n;i++)
		{
			scanf("%ld",&t);
			aa[t]++;
			if(aa[t]>=(n+1)/2)
			{
				re=t;
			}			
		}
		printf("%d\n",re);
	}
} 

第二种稍微浪费空间，加一个快搜，因为有(N+1)/2个，所以排序以后中间位置的一定是答案

#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
using namespace std;

int main(){
    int t;
    while(~scanf("%d",&t)){
        vector <int> a(t);
        for(int i=1;i<=t;i++){
            scanf("%d",&a[i]);
        }
        sort(a.begin(),a.end());
        printf("%d\n",a[t/2]);

    }
    return 0;
}

第三个就很好，就定义了五个int空间，时间复杂度也。。
因为有(N+1)/2个，所以无论如何一定可以更新到答案

#include<iostream>
#include<algorithm>
using namespace std;
const int X=1000005;

int main(){
    int t;
    while(~scanf("%d",&t)){
        int a,ans,sum=0;
        while(t--){
            scanf("%d",&a);
            if(sum==0) ans = a;
            
         if(a==ans) sum++;
         else sum--;
        }
        printf("%d\n",ans);
    }
    return 0;
}