杭电1029 之 Ignatius and the Princess IV
来源:互联网 发布:原始地貌测量数据 编辑:程序博客网 时间:2024/06/10 03:24
Ignatius and the Princess IV
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others)Total Submission(s): 31297 Accepted Submission(s): 13415
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个数,打印出现次数最多的数
AC代码如下:
#include <iostream>#include <cstdio>#include <cstring>using namespace std;const int maxn=999999+10;int a[maxn],b[maxn];int main(){ int n; while(cin>>n) { memset(b,0,sizeof(b)); int maxi=-1; int cur=-1; for(int i=0;i<n;i++) cin>>a[i]; for(int i=0;i<n;i++) { b[a[i]]++; if(b[a[i]]>maxi) { maxi=b[a[i]]; cur=a[i]; } } cout<<cur<<endl; } return 0;}
0 0
- 杭电1029 之 Ignatius and the Princess IV
- 杭电OJ 1029:Ignatius and the Princess IV
- 杭电 1029 Ignatius and the Princess IV
- 杭电 HDU 1029 Ignatius and the Princess IV
- c语言杭电1029Ignatius and the Princess IV
- 杭电1029 Ignatius and the Princess IV
- 杭电HDOJ 1029 Ignatius and the Princess IV
- 杭电 1029 Ignatius and the Princess IV (技巧数学题)
- 杭电OJ(HDOJ)1029题:Ignatius and the Princess IV(数论)
- 杭电ACM OJ 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
- (双指针)leetcode 26、 27、203、283
- angularjs 自定义服务
- UI框架(里面的东西非常全面)
- 题目1445:How Many Tables 九度OJ
- 【C++学习笔记】宽字符(LPCWTR/wstring)和(char*/string)的转换实现
- 杭电1029 之 Ignatius and the Princess IV
- UnicodeEncodeError: 'ascii' codec can't encode characters in position 32-35: ordinal not in range(12
- openglesForC++矩形旋转
- 集合框架-Collections
- USACO 2017 January Contest, Gold Problem 1. Balanced Photo
- hololens
- Spring MVC常用的注解
- KM算法
- 单页应用跳转实现浅析-demo篇