#include <bits/stdc++.h> using namespace std; const int size = 201718 + 4; // ? int main() { int n; cin >> n; int v[size] = {0}; int best = 0; for (int i = 0; i < n; i++) { int x; cin >> x; v[x]++; best = max(best, x); while (v[x] > 1) { best = max(best, x + 1); v[x + 1] += v[x] / 2; v[x++] %= 2; } } cout << best << endl; }
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 | #include <bits/stdc++.h> using namespace std; const int size = 201718 + 4; // ? int main() { int n; cin >> n; int v[size] = {0}; int best = 0; for (int i = 0; i < n; i++) { int x; cin >> x; v[x]++; best = max(best, x); while (v[x] > 1) { best = max(best, x + 1); v[x + 1] += v[x] / 2; v[x++] %= 2; } } cout << best << endl; } |