1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 1e6 + 9;

int tab[MAX_N];

int n;

int main()
{
    scanf("%d", &n);

    int furthest = 0;

    for(int i = 0; i < n; ++i)
    {
        int a;

        scanf("%d", &a);

        furthest = max(furthest, a);

        ++tab[a];
    }

    for(int i = 0; i <= furthest; ++i)
    {
        tab[i + 1] += tab[i] / 2;

        if(tab[i + 1] > 0)
            furthest = max(furthest, i + 1);
    }

    printf("%d\n", furthest);

    return 0;
}