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
40
#include <iostream>

using namespace std;
const int N = 201718;
int tab[N + 1];

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, a;
	cin >> n;
	while (n--)
	{
		cin >> a;
		++tab[a];
	}
	int maks = 0;
	for (int i = 0; i < N; i++)
	{
		tab[i + 1] += tab[i] / 2;
		if (tab[i] != 0)
		{
			maks = i;
		}
	}
	if (tab[N] != 0)
	{
		maks = N;
		while ((tab[N] >> 1) > 0)
		{
			maks++;
			tab[N] >>= 1;
		}
	}
	cout << maks;

	return 0;
}