hdu 1029 map做法
来源:互联网 发布:阿里云服务器ip段 编辑:程序博客网 时间:2024/04/30 00:01
Ignatius and the Princess IV
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others)Total Submission(s): 9654 Accepted Submission(s): 3785
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为奇数 问某个数出现的次数大于等于(N+1)/2的是 哪个 输出来思路 map记录#include<stdio.h>#include<map>#include<iostream>using namespace std;map<int,int>mp;int main(){int i,j,n,N; while(scanf("%d",&n)!=EOF){N=n;mp.clear();while(n--){scanf("%d",&i);mp[i]++;}map<int,int>::iterator it;printf("cc");for(it=mp.begin();it!=mp.end();i++){if(it->second>=(N+1)/2) {printf("%d\n",it->first);break;}}}return 0;}
- hdu 1029 map做法
- hdu 1075 字典树 和 map做法
- hdu 1247 字典树以及map+string 2种做法
- POJ2503 Babelfish map做法
- HDU——2723Electronic Document Security(STL map嵌套set做法)
- POJ 2503 Babelfish map做法
- 循环Map的错误做法
- HDU 5919 分块做法
- hdu 1263 java做法
- 【HDU】 3605 Escape(暴力做法...)
- HDU 1028 母函数做法
- HDU--2829--Lawrence--斜率优化做法
- HDU - 1166 敌兵布阵 树状数组做法
- hdu 1058 朴素算法和DP做法
- hdu-2544 最短路(SPFA做法)
- hdu-1874 畅通工程续(SPFA做法)
- HDU 1501 Zipper (DFS+剪枝做法)
- 数据结构实验之查找三:树的种类统计---(查找树做法与map做法)
- javascript实现定时器四秒后跳转到秋秋淘衣坊首页(setInterval计时器)
- oracle的使用<一>支持的数据类型
- 2012年暑假总结
- 做种苹果树的人
- IE6中字符编码影响CSS的问题
- hdu 1029 map做法
- 延安客车罐车相撞引发的联想
- 消除: warning C4996: 'sprintf': This function or variable may be unsafe. Consider 的方法 .
- 64位WIN7的cmd功能无效解决办法
- union 共用体 联合体
- 排序?重叠数?傻傻分不清楚
- 数状数组
- WPF 深入研究 之 Control 控件
- HTML5代替Cookie? HTML5本地存储安全性