ACM--最少(n+1)/2--HDOJ 1029--Ignatius and the Princess IV--水
来源:互联网 发布:电脑插件软件 编辑:程序博客网 时间:2024/06/07 17:35
HDOJ题目地址:传送门
Ignatius and the Princess IV
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others)
Total Submission(s): 26494 Accepted Submission(s): 11217
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+1)/2,并且是最大的
#include<stdio.h>#include<iostream>#include<memory.h>using namespace std;int res[1000000];int main(){ int n; while(scanf("%d",&n)!=EOF){ memset(res,0,sizeof(res)); int temp,result=0; int index=(n+1)/2; for(int i=1;i<=n;i++){ scanf("%d",&temp); res[temp]++; if(res[temp]>=index){ result=temp; index=res[temp]; } } printf("%d\n",result); }}
1 0
- ACM--最少(n+1)/2--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
- HDU-OJ-1029 Ignatius and the Princess IV-出现至少(N+1)/2次的数
- 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 (水题)
- AsyncTask的使用和源码分析
- PHP静态变量和全局变量的区别
- 对js闭包的理解
- 1053. Path of Equal Weight (30)
- K-means聚类算法
- ACM--最少(n+1)/2--HDOJ 1029--Ignatius and the Princess IV--水
- js依据合同生效日和到期日算合同年限,以年为单位
- HDOJ 1576 A/B
- jzoj 1577. 【普及模拟】抓猫
- Android Studio Gradle Build Running 特别慢的问题
- Lambda架构实现数据实时更新
- 网站测速服务 查看自己网站在全球的打开速度
- Android学习之路------广播的注册方式
- 蓝桥杯:字符串替换