HDU 1029
来源:互联网 发布:剑三藏剑成女捏脸数据 编辑:程序博客网 时间:2024/05/19 00:09
Ignatius and the Princess IV
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others)Total Submission(s): 14406 Accepted Submission(s): 5841
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
Author
Ignatius.L
#include <iostream>using namespace std;int a[999999+1];int main(){int n,i,e,j;while(~scanf("%d",&n)){j=0;memset(a, 0, sizeof(a));for(i=0;i<n;i++){scanf("%d",&e);a[e]++;if(a[e]>=(n+1)/2)j=e;}cout<<j<<endl;}return 0;}其中要找 n+1/2,就是排序后中间位置的数。
别人的代码:
#include <iostream>#include <vector>#include <algorithm>#include <string>using namespace std;int main(){int n,i;while(~scanf("%d",&n)){vector <int> v1(n,0);for(i=0;i<n;i++)scanf("%d",&v1[i]);sort(v1.begin(), v1.end());cout<<v1[(n+1)/2]<<endl;}return 0;}
0 0
- hdu 1029
- hdu 1029
- HDU 1029
- hdu 1029
- hdu 1029
- HDU 1029
- HDU 1029
- hdu 1029
- hdu 1029
- hdu 1029
- hdu 1029
- hdu 1029
- HDU 1029
- HDU 1029
- HDU 1029
- hdu 1029
- HDU 1029
- hdu 1029
- HDU:1394 Minimum Inversion Number
- Android Activity总结
- OC基本功(二)使用宏在程序中加入测试代码
- 聊聊JVM的年轻代
- Tomcat 学习进阶历程之http协议
- HDU 1029
- 兰姆达表达式Lambda 表达式(C# 编程指南)
- 学习笔记 android fragment
- 45度角地图坐标计算
- POJ 1201 差分约束
- 最短路径算法Dijkstra和A*
- eclipse安装svn插件
- 粒子效果初试-喷射方向
- POJ 3049 Invitation Cards ( 快排+深搜)