hdoj 1029 Ignatius and the Princess IV 【简单】
来源:互联网 发布:条形码扫描枪软件 编辑:程序博客网 时间:2024/04/30 21:23
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?
"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
51 3 2 3 3111 1 1 1 1 5 5 5 5 5 571 1 1 1 1 1 1
Sample Output
351
分析:
找到最多出现的那个数就是特殊数,所以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 0x3f3f3f3fusing 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;}
0 0
- hdoj 1029 Ignatius and the Princess IV 【简单】
- 【HDOJ】1029 -> Ignatius and the Princess IV
- hdoj 1029 Ignatius and the Princess IV
- HDOJ 1029 Ignatius and the Princess IV
- HDOJ Ignatius and the Princess IV 1029
- HDOJ 1029 Ignatius and the Princess IV
- hdoj 1029 Ignatius and the Princess IV
- HDOJ 1029 Ignatius and the Princess IV
- hdoj-1029-Ignatius and the Princess IV
- hdoj 1029 Ignatius and the Princess IV
- HDOJ 1029 Ignatius and the Princess IV
- HDOJ 1029 Ignatius and the Princess IV [map]
- HDOJ 1029:Ignatius and the Princess IV 解题报告
- hdoj.1029 Ignatius and the Princess IV 20140809
- HDOJ 1029 Ignatius and the Princess IV 【math】
- HDOJ 1029 Ignatius and the Princess IV (水题)
- HDOJ 1029 Ignatius and the Princess IV(易题)
- 杭电HDOJ 1029 Ignatius and the Princess IV
- Booting a Raspberry Pi 2 with u-boot
- 网络编程:qq编写总结
- Oracle Databasae wallet使用指南
- TCP(传输控制协议)
- 数据结构(Java)——迭代器和列表的实例
- hdoj 1029 Ignatius and the Princess IV 【简单】
- 代码重构精简
- 图像处理提取图像的奇数行列-学习笔记1
- String、StringBuilder、StringBuffer
- 内部类---局部内部类和匿名内部类
- Java的七种单例模式
- LeetCode题解——Sum Root to Leaf Numbers
- 更新gcc-4.9.3时遇到的错误
- 【GZOJ】1370——名为F的数列