HDU-1029-Ignatius and the Princess IV
来源:互联网 发布:安乡论坛网络问政 编辑:程序博客网 时间:2024/06/04 20:13
HDU1029
Ignatius and the Princess IV
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others)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个数,让你找到出现次数不小于(n+1)/2的数字;
直接桶排序就OK;cin于cout会超时;
#include<bits/stdc++.h>using namespace std;int n,a[1000000];int main() { while(~scanf("%d",&n)){memset(a,0,sizeof(a));for(int i=0;i<n;i++){int t;scanf("%d",&t);a[t]++;}for(int i=0;i<1000000;i++){if(a[i]>=(n+1)/2){printf("%d\n",i);break;}}} return 0; }
阅读全文
0 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
- 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 hdu 1029
- 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
- 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
- hdu - 1029 -Ignatius and the Princess IV
- 搜索引擎
- 百度实习面经
- Git fetch和git pull的区别
- 解决NSIS Error error launching installer问题
- Linux后台运行java的jar包
- HDU-1029-Ignatius and the Princess IV
- matlab 求解线性规划
- 五月天,请让我再任性一次
- opencv 3.0 DPM Cascade 检测 (附带TBB和openMP加速)
- spark动态资源分配
- dp——vijos1207
- 常用的几款SSH工具通过密匙认证连接远程主机
- Android面试题—校招—美团
- 密码学——公钥与私钥