CodeForces 305C--Ivan and Powers of Two (STL:set)

最新推荐文章于 2018-11-28 11:09:33 发布

HonniLin

最新推荐文章于 2018-11-28 11:09:33 发布

阅读量763

点赞数

分类专栏： CF 文章标签： C++ STL cf

本文链接：https://blog.csdn.net/sotifish/article/details/25197599

版权

CF 专栏收录该内容

20 篇文章 0 订阅

订阅专栏

好玩儿的题目:

Ivan has got an array of n non-negative integers a₁, a₂, ..., a_n. Ivan knows that the array is sorted in the non-decreasing order.

Ivan wrote out integers 2^a₁, 2^a₂, ..., 2^a_n on a piece of paper. Now he wonders, what minimum number of integers of form 2^b (b ≥ 0) need to be added to the piece of paper so that the sum of all integers written on the paper equalled 2^v - 1 for some integer v (v ≥ 0).

Help Ivan, find the required quantity of numbers.

Input

The first line contains integer n (1 ≤ n ≤ 10⁵). The second input line contains n space-separated integers a₁, a₂, ..., a_n (0 ≤ a_i ≤ 2·10⁹). It is guaranteed that a₁ ≤ a₂ ≤ ... ≤ a_n.

Output

Print a single integer — the answer to the problem.

Sample test(s)

Input

4
0 1 1 1

Output

Input

1
3

Output

Note

In the first sample you do not need to add anything, the sum of numbers already equals 2³ - 1 = 7.

In the second sample you need to add numbers 2⁰, 2¹, 2².

题意: 给你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;
}