hdoj 1029 Ignatius and the Princess IV 【简单】

原创 2015年11月17日 21:43:17


Ignatius and the Princess IV

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


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必须是奇数。
代码:
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<queue>
#include<stack>
#include<vector>
#define mem(x,y) memset(x,y,sizeof(x));
#define max(a,b) a>b?a:b
#define min(a,b) a<b?a:b
#define inf 0x3f3f3f3f
using namespace std;


int main()
{
    long long n,num,cnt,pp;
    while(scanf("%lld",&n)!=EOF)
    {
        cnt=0;
        while(n--)
        {
            scanf("%lld",&num);
            if(cnt==0)
            {
                cnt++;
                pp=num;
            }
            else{
            if(pp==num)
                cnt++;
            else cnt--;
            }
        }
        printf("%lld\n",pp);
    }
    return 0;
}

版权声明:博主情人,外人误碰!!!

HDU 1029 Ignatius and the Princess IV(动规水题,有个很精妙的快解法)

HDU 1029 Ignatius and the Princess IV(动规水题,有个很精妙的快解法)

hdu-1029 Ignatius and the Princess IV

hdu-1029 Ignatius and the Princess IV题目描述 Ignatius and the Princess IV Time Limit: 2000/1000 ...

dp-基础3 B - Ignatius and the Princess IV HDU - 1029

dp基础题解

HDU 1029 Ignatius and the Princess IV(水题亦有妙法)

题目链接:[kuangbin带你飞]专题十二 基础DP1 B - Ignatius and the Princess IV题意 给n(奇数)个数,定义特殊的数为在序列中出现次数不少于(n+1)/2...

HDU 1029 Ignatius and the Princess IV

Problem Description "OK, you are not too bad, em... But you can never pass the next test." feng5166...

HDU-1029-Ignatius and the Princess IV

Ignatius and the Princess IV Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32767 K ...

hdu 1029 Ignatius and the Princess IV

Problem Description "OK, you are not too bad, em... But you can never pass the next test." feng5166 ...

杭电 1029 Ignatius and the Princess IV

http://acm.hdu.edu.cn/showproblem.php?pid=1029 Ignatius and the Princess IV Time Limit: 2000/1000 ...

hdu 1029 Ignatius and the Princess IV(主元素问题):

Ignatius and the Princess IV Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32767 K ...
  • wchhlbt
  • wchhlbt
  • 2016年08月05日 16:17
  • 136

杭电1029 Ignatius and the Princess IV

//此方法必须要求存在一测试数据出现次数大于(n+1)/2;  #include int main() { int n,m,i,count,max; while(~scanf("%d",&n)) { ...
  • wyjwyl
  • wyjwyl
  • 2015年04月06日 17:20
  • 378
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:hdoj 1029 Ignatius and the Princess IV 【简单】
举报原因:
原因补充:

(最多只允许输入30个字)