hdu 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): 26993    Accepted Submission(s): 11454

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
 
 

解题思路：这是一类比较经典的主元素问题，以前在一本书上看过，上来当成一道水题直接做了，最开始使用sort排序然后输出第n/2个元素，不过TLE了..后来才知道其实不应该用cin、cout，不过倒是因祸得福，让我继续思考了这个问题，换了一个O（n）的做法，因为这个主元素肯定会出现一半以上，所以说如果每出现两个不相同的数，可以把他们都删去，新数列的主元素与原来数列相同。

O(nlgn)做法：

int a[1000005];
int main()
{
    //freopen("test.txt","r",stdin);
    while(~scanf("%d",&n))
    {
        for(int i=0;i<n;i++)
            scanf("%d",&a[i]);
        sort(a,a+n);
        cout << a[n/2] << endl;
    }
    //cout << "Hello world!" << endl;
    return 0;
}

O(n)

int a[1000005];
int main()
{
    //freopen("test.txt","r",stdin);
    while(~scanf("%d",&n))
    {
        int k = 0;
        int temp;
        scanf("%d",&a[k]);
        for(int i=1; i<n; i++)
        {
            scanf("%d",&temp);
            if(k<0)
            {
                k = 0;
                a[k] = temp;
                continue;
            }
            if(temp==a[k])
                a[++k] = temp;
            else
                k--;

        }
        printf("%d\n",a[0]);
    }
    //cout << "Hello world!" << endl;
    return 0;
}