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
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
#include <cstdio>

using namespace std;

int main()
{
  long long n;

  scanf("%lld", &n);

  long long tab[n];

  int tabX[n];

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

    scanf("%lld", &k);

    tab[i]  = k;
    tabX[i] = 1;
  }

  int again = 0;

  for (int moneta = 0; moneta < n; )
  {
    if (tabX[moneta] == 0)
    {
      moneta++;

      continue;
    }

    int i = moneta + 1;

    for (;i < n; i++)
    {
      if (tabX[i] == 0)
      {
        continue;
      }

      if (tab[moneta] == tab[i])
      {
        tab[moneta]++;

        tabX[i] = 0;

        again = 1;

        break;
      }
    }

    if (again == 1)
    {
      again = 0;
    }
    else
    {
      moneta++;
    }
  }

  long long max = 0;

  for (int i = 0; i < n; i++)
  {
    if (max < tab[i])
    {
      max = tab[i];
    }
  }

  printf("%lld\n", max);

  return 0;
}