hdu 1029

原创 2013年12月04日 12:02:14

Ignatius and the Princess IV

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32767 K (Java/Others)
Total Submission(s): 13878    Accepted Submission(s): 5634


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
 

1. 分析

题目大意就是在一组数中寻找一个出现超过(或等于)一半的数。
因此,我们可以将该数组分为两部分,一部分是等于要寻找的数x,一部分是不等于x的数,因此有:x出现的次数>=不等于它的出现的数的次数,从而可以假设该数为x,当后边出现的数等于x时,将其计数值times(初始值为0)加一,否则减一,当times==0时,则表明肯定不是该数,从而又假设x等于当前读入的数t,按照这种方法可以得到结果

2. AC代码

#include <stdio.h>

int main() {
	int n, k, charactor, times;
	while (EOF != scanf("%d", &n)) {
	    times = 0;
	    while(n--) {
	        scanf("%d", &k);
	        if (times<=0) charactor=k;
	        (k==charactor) ? (++times) : (--times);
	    }
	    printf("%d\n", charactor);
	}
	return 0;
}

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

hdu1029 Ignatius and the Princess IV

Ignatius and the Princess IV Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32767 K ...

hdu 1029 Ignatius and the Princess IV

Problem Description "OK, you are not too bad, em... But you can never pass the next test." feng5166 ...

HDU1029 Ignatius and the Princess IV

问题链接:HDU1029 Ignatius and the Princess IV。基础练习题,用C++语言编写。 题意简述:输入n(n是奇数),然后输入n个整数,求出现(n+1)/2次的整数。 问题...

hdu 1029 Ignatius and the Princess IV

Ignatius and the Princess IV Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32767 K (...

HDU-1029-Ignatius and the Princess IV

Ignatius and the Princess IV Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32767 K ...

HDU 1029

初看此题,就把它当做了一道哈希表的题目(因为题目范围很不明确)。后来自己也确实是用hash的方法过的。此处贴出,也是为了稍微复习下hash的知识。话不多说,以下是本人写的代码。 Hash: #incl...

hdu 1029 Ignatius and the Princess IV

题意:找出出现次数大于(N+1)/2的数。 思路:开一个二维数组dp[ i ][ j ]--- i 表示摸个数,j 表示 i 这个数出现的次数。 Ignatius...

HDU 1029 Ignatius and the Princess IV(动规水题,有个很精妙的快解法)

HDU 1029 Ignatius and the Princess IV(动规水题,有个很精妙的快解法)

ZOJ-1029(POJ-1083、HDU-1050) Moving Tables

Moving Tables Time Limit: 2 Seconds      Memory Limit: 65536 KB The famous ACM (Advanced Compu...

HDU 1029(鸽巢原理)

Ignatius and the Princess IV Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32767 K ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)