HDU1029-Ignatius and the Princess IV
来源:互联网 发布:java基础自学需要多久 编辑:程序博客网 时间:2024/05/16 00:40
Ignatius and the Princess IV
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others)
Total Submission(s): 34150 Accepted Submission(s): 14867
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?
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
5
1 3 2 3 3
11
1 1 1 1 1 5 5 5 5 5 5
7
1 1 1 1 1 1 1
Sample Output
3
5
1
Author
Ignatius.L
题目大意:有奇数个数字,输出个数大于等于(n+1)/2的数字。
解题思路:排序,或者O(n)扫一遍。
#include<iostream>#include<cstdio>#include<string>#include<cmath>#include<vector>#include<map>#include<set>#include<queue>#include<algorithm>#include<cstring>using namespace std;typedef long long LL;const int INF=0x3f3f3f3f;const int MAXN=1e6+5;int a[MAXN];int main(){ int n; while(scanf("%d",&n)!=EOF) { for(int i=1;i<=n;i++) { scanf("%d",&a[i]); } sort(a+1,a+n+1); if(n&1) { printf("%d\n",a[(n+1)/2]); }else { int x=a[n/2],y=a[n/2+1]; if(a[1]==x&&a[n]!=y) printf("%d\n",x); else printf("%d\n",y); } }}/*51 3 2 3 3111 1 1 1 1 5 5 5 5 5 571 1 1 1 1 1 1351*/
#include<iostream>#include<cstdio>#include<string>#include<cmath>#include<vector>#include<map>#include<set>#include<queue>#include<algorithm>#include<cstring>using namespace std;typedef long long LL;const int INF=0x3f3f3f3f;const int MAXN=1e6+5;int a[MAXN];int main(){ int n; while(scanf("%d",&n)!=EOF) { int ans; int cnt=0; for(int i=1;i<=n;i++) { scanf("%d",&a[i]); if(cnt==0) { ans=a[i];cnt++; }else { if(a[i]==ans) cnt++; else cnt--; } } printf("%d\n",ans); } return 0;}
- HDU1029:Ignatius and the Princess IV
- hdu1029 Ignatius and the Princess IV
- hdu1029 Ignatius and the Princess IV
- HDU1029-Ignatius and the Princess IV
- hdu1029 B - Ignatius and the Princess IV
- hdu1029 Ignatius and the Princess IV
- HDU1029 Ignatius and the Princess IV
- hdu1029 Ignatius and the Princess IV 水题
- HDU1029:Ignatius and the Princess IV
- HDU1029 Ignatius and the Princess IV
- hdu1029 Ignatius and the Princess IV
- Ignatius and the Princess IV||HDU1029
- HDU1029-Ignatius and the Princess IV
- 【hdu1029 】Ignatius and the Princess IV
- HDU1029——Ignatius and the Princess IV
- HDU1029----Ignatius and the Princess IV(map实现)
- hdu1029 Ignatius and the Princess IV——多数元素
- hdu1029 Ignatius and the Princess IV(DP求数列中出现次数过半的数)
- Akka(18): Stream:组合数据流,组件-Graph components
- Java--a++与 ++a 与 a=a+1 与a+=1
- HDU 6129 Just do it (组合数)
- 线性分类器-Tumer Prediction
- Kotlin 基础
- HDU1029-Ignatius and the Princess IV
- 15_接水问题
- ifconfig
- 使用POI导入Excel文件信息
- 织梦DEDE网站程序动态化+静态化+伪静态设置(图文)教程
- html接入海康视频数据
- Eureka+ribbon 实现服务注册与发现和负载均衡
- Netty ByteBuf 释放注意事项
- 网站开发(九)后台栏目的删除操作