好玩儿的题目:
Ivan has got an array of n non-negative integers a1, a2, ..., an. Ivan knows that the array is sorted in the non-decreasing order.
Ivan wrote out integers 2a1, 2a2, ..., 2an on a piece of paper. Now he wonders, what minimum number of integers of form 2b (b ≥ 0) need to be added to the piece of paper so that the sum of all integers written on the paper equalled 2v - 1 for some integer v (v ≥ 0).
Help Ivan, find the required quantity of numbers.
The first line contains integer n (1 ≤ n ≤ 105). The second input line contains n space-separated integers a1, a2, ..., an (0 ≤ ai ≤ 2·109). It is guaranteed that a1 ≤ a2 ≤ ... ≤ an.
Print a single integer — the answer to the problem.
4 0 1 1 1
0
1 3
3
In the first sample you do not need to add anything, the sum of numbers already equals 23 - 1 = 7.
In the second sample you need to add numbers 20, 21, 22.
题意: 给你n 个数 按照升序排列, a1,a2,..an..分别代表2^a1...若个数加起来的结果等于( 2^u(u任意)-1 ) 则无需再添加数, 否则应计算出 需添加几个数...
思路: 想到了 2^0+2^1+2^2+...+2^n=2^(n+1)-1, 结果脑袋就卡壳了....
... 看了人家的思路恍然大悟...还应该立马反应出一数学公式, 2^v+2^v=2^(2v).. 即将数列里相同的两个数加起来, 在存入 set中即可, 保证处理过的数列无重复数字...
CODE:
#include <iostream>
#include<stdio.h>
#include<set>
using namespace std;
set<int>q;
int main()
{
//freopen("in.in","r",stdin);
int n;
while(~scanf("%d",&n))
{
int a;
q.clear();
int maxn=0;
while(n--)
{
scanf("%d",&a);
while(q.count(a))
{
q.erase(a);
a++;
}
q.insert(a);
maxn=max(maxn,a);
}
printf("%d\n",maxn-q.size()+1);
}
return 0;
}