题目描述:
"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?
大致思路:
如果上来就用搜索的话会超时。那么就有几种思想的变种,可以快排之后用upper_bound和lower_bound这两个函数计算相同数目,然后还可以用一个变量记录相同数目,然后加加减减最后得到答案。
代码:
"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?
大致思路:
如果上来就用搜索的话会超时。那么就有几种思想的变种,可以快排之后用upper_bound和lower_bound这两个函数计算相同数目,然后还可以用一个变量记录相同数目,然后加加减减最后得到答案。
代码:
#include <cstdio>
using namespace std;
int main()
{
int ans, n, c, num;
while (~scanf("%d", &n))
{
c = 0;
for (int i=1;i<=n;++i)
{
scanf("%d", &ans);
if (c==0)
{
num = ans;
c ++;
}
else if (ans == num) c ++;
else c --;
}
printf("%d\n", num);
}
return 0;
}