HDU 1029.Ignatius and the Princess IV【数据弱鸡】【咦,水题!】【8月20】
2015-08-20 16:59
465 查看
Ignatius and the Princess IV
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
Sample Output
给你n个数,输出其中出现次数大于等于(n+1)/2的数。直接做就能过,这题数据太弱了,不然肯定超时。代码如下:
但是上面这种方法用的空间有点大,尝试用map做。代码如下:
时间效率不高····充分说明了这个题的数据弱!
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
给你n个数,输出其中出现次数大于等于(n+1)/2的数。直接做就能过,这题数据太弱了,不然肯定超时。代码如下:
#include<cstdio> #include<cstring> int f[1000100]; int main(){ int n,ans,x; while(scanf("%d",&n)==1){ memset(f,0,sizeof(f)); for(int i=0;i<n;i++){ scanf("%d",&x); f[x]++; if(f[x]>=(n+1)/2) ans=x; } printf("%d\n",ans); } return 0; }
但是上面这种方法用的空间有点大,尝试用map做。代码如下:
#include<cstdio> #include<map> using namespace std; int main(){ int n,ans,x; map<int,int> f; while(scanf("%d",&n)==1){ f.clear(); for(int i=0;i<n;i++){ scanf("%d",&x); f[x]++; if(f[x]>=(n+1)/2) ans=x; } printf("%d\n",ans); } return 0; }
时间效率不高····充分说明了这个题的数据弱!
相关文章推荐
- mac电脑jdk版本切换
- DOM(二)-07-DOM(示例-创建表格)
- ubuntu下安装numpy,matplotlib
- android 自定义TextView"会发脾气的TextView"
- 《AndroidStudio每日一贴》3.快速切换代码风格、配色方案和键盘
- PHP中正则表达式学习及应用(一)
- MAC 版 sublime text 2 安装插件管理器
- 虚拟化--037 vsphere 更改vsphere client和vsphere web client登陆语言
- iOS在进行网络请求的时候的网络状态的响应的判断
- 视图中order by 的使用
- tomcat7.0.63 (redis session方案)
- CentOS修改MySql数据库目录datadir
- Vim简明教程【CoolShell】
- 虚拟化--034 vsphere添加用户登录的权限
- DOM(二)-06-(示例-好友菜单)
- UIViewController中的edgesForExtendedLayout和extendedLayoutIncludesOpaqueBars属性
- nginx配置
- 生成条形码
- .NET中Redis的使用
- 算法竞赛入门经典习题2-10排列