hdoj 1029 Ignatius and the Princess IV
来源:互联网 发布:js数组 break 编辑:程序博客网 时间:2024/04/30 17:43
Ignatius and the Princess IV
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others)
Total Submission(s): 19345 Accepted Submission(s): 7843
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
其实做这道题时 我不知道特别的数有几个。。。先试了就一个数的情况,结果就过了。
#include<stdio.h>#include<string.h>#include<algorithm>#define max 1000000int dp[max];using namespace std;bool cmp(int x,int y){return x>y;}int main(){int n,a,i,j,sum,M;while(scanf("%d",&n)!=EOF){memset(dp,0,sizeof(dp));M=0;for(i=0;i<n;i++){scanf("%d",&a);dp[a]++;if(M<a) M=a;}for(i=1;i<=M;i++){if(dp[i]>=(n+1)/2){printf("%d\n",i);break;}}}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 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(易题)
- 杭电HDOJ 1029 Ignatius and the Princess IV
- arp欺骗与利用工具
- HDU 1166--敌兵布阵【树状数组】
- 哈尔滨理工大学第五届ACM程序设计竞赛 沼跃鱼 KMP or 暴力
- hdoj 哈希
- CollectionView的委托和数据源
- hdoj 1029 Ignatius and the Princess IV
- 自定义ListView中的分割线
- EL和JSTL表达式
- C#一种不安全的方法跨线程访问控件
- django中报错TypeError: su() takes exactly 1 argument (2 given)的解决办法
- MFC用CStdioFile类读取中文文本时乱码问题的一种解决方法
- Windows 7平台搭建Android Cocos2d-x3.4开发环境 遇到问题解决方法
- 第二学期第三周 项目1
- 晶振为什么要加电容 需要配多大电容