HDU1029:Ignatius and the Princess IV -DP求一列数中出现次数最多的数的次数
2015-04-29 21:05
381 查看
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
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int a[1000000];
struct node
{
int shu;
int num;
}b[1000000];
bool cmp(node a,node b)
{
return a.num>b.num;
}
int main()
{
int n,i,k;
while(~scanf("%d",&n))
{
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
sort(a,a+n);
for(i=0;i<n;i++)
{
b[i].num=0;
}
b[0].shu=a[0];
b[0].num++;
k=0;
for(i=1;i<n;i++)
{
if(a[i]==b[k].shu)
{
b[k].num++;
}
else
{
b[++k].shu=a[i];
b[k].num++;
}
}
sort(b,b+k+1,cmp);
printf("%d\n",b[0].shu);
}
return 0;
}
//这道题用了一个排序的思想,有时候排序的思想是特别有技巧,特别好使的
"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
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int a[1000000];
struct node
{
int shu;
int num;
}b[1000000];
bool cmp(node a,node b)
{
return a.num>b.num;
}
int main()
{
int n,i,k;
while(~scanf("%d",&n))
{
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
sort(a,a+n);
for(i=0;i<n;i++)
{
b[i].num=0;
}
b[0].shu=a[0];
b[0].num++;
k=0;
for(i=1;i<n;i++)
{
if(a[i]==b[k].shu)
{
b[k].num++;
}
else
{
b[++k].shu=a[i];
b[k].num++;
}
}
sort(b,b+k+1,cmp);
printf("%d\n",b[0].shu);
}
return 0;
}
//这道题用了一个排序的思想,有时候排序的思想是特别有技巧,特别好使的
相关文章推荐
- hdu1029 Ignatius and the Princess IV(DP求数列中出现次数过半的数)
- HDU1029:Ignatius and the Princess IV(找出数组中出现次数超过一半的数字)
- 找出现次数最多的数-Ignatius and the Princess IV
- HDU1029-Ignatius and the Princess IV
- 【hdu1029 】Ignatius and the Princess IV
- kuangbin求带飞DP1 Ignatius and the Princess IV( 漂亮的解法!!)
- HDOJ 1029 Ignatius and the Princess IV(数位dp)
- dp-基础3 B - Ignatius and the Princess IV HDU - 1029
- HDU 1029 Ignatius and the Princess IV(基础dp(思维))
- hdu1029 B - Ignatius and the Princess IV
- HDU1029 Ignatius and the Princess IV
- HDU-1029 Ignatius and the Princess IV(DP?)
- Ignatius and the Princess IV||HDU1029
- B - Ignatius and the Princess IV DP
- hdu1029 Ignatius and the Princess IV 水题
- [kuangbin带你飞]专题十二 基础DP1 -B - Ignatius and the Princess IV
- HDU1029:Ignatius and the Princess IV
- 【算法系列学习】[kuangbin带你飞]专题十二 基础DP1 B - Ignatius and the Princess IV
- HDU - 1029 Ignatius and the Princess IV(DP)
- hdu 1029 Ignatius and the Princess IV DP