杭电1029
来源:互联网 发布:什么是做淘宝 编辑:程序博客网 时间:2024/05/16 01:07
"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#include <stdio.h>#include <map>#include <iostream>using namespace std;int main(){ int i, n; int max, a; int index; while (cin >> n) { map<int, int> m; max = 0; for (i = 0; i<n; i++) { cin >> a; m[a]++; if (m[a]>max) { max = m[a]; index = a; } } cout << index << endl; } return 0;}网上还有另一种方法,好像也能过。#include<stdio.h>void main(){ int n,ans,temp,c; while(scanf("%d",&n)!=EOF&&n) { scanf("%d",&ans),c=1; for(int i=2;i<=n;++i) { scanf("%d",&temp); c+=(temp==ans?1:-1); if(!c) scanf("%d",&ans),++i,c=1; } printf("%d\n",ans); }}
0 0
- 杭电1029
- 杭电1029
- 杭电1029
- 杭电 1029
- 杭电 1029
- 杭电1029
- 杭电1029
- 杭电 OJ 1029
- 杭电
- 杭电
- 杭电
- 杭电 1234 和 杭电 2115
- 杭电2056之Rectangles 杭电
- 杭电ACM1061Rightmost Digit
- 杭电2099 7.11
- 杭电ACM 1003
- 杭电 ACM 2016
- 杭电ACM1466
- ORACLE 函数 随机生成手机号,时间
- 三种视频编码的方式
- Android系统的启动流程
- redis学习资料
- 修改工程名,类名
- 杭电1029
- POJ 2533 Longest Ordered Subsequence(最长递增子序列)
- 使用音频数组,根据音频的名字来播放相关的音频
- [Module]quamash模块安装
- git 设置SSH认证
- (NYoj 489)哭泣天使 -- 网络最大流,关于网格的建图方法,Dinic
- 对Android初学者学习中的几点建议
- ToolsUtil
- 判断字符串是不是日期格式