#include <iostream> #include <algorithm> using namespace std; int potegi[201719]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; int max_v = 0; for (int i = 0; i < n; ++i) { int a; cin >> a; ++potegi[a]; max_v = max(max_v, a); } for (int i = 1; i < 201719; ++i) { potegi[i] += potegi[i - 1] / 2; if (i > max_v && potegi[i] > 0) { max_v = i; } } if (potegi[max_v] > 1) { int temp = potegi[max_v]; while (temp > 1) { ++max_v; temp /= 2; } } cout << max_v; return 0; }
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 | #include <iostream> #include <algorithm> using namespace std; int potegi[201719]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; int max_v = 0; for (int i = 0; i < n; ++i) { int a; cin >> a; ++potegi[a]; max_v = max(max_v, a); } for (int i = 1; i < 201719; ++i) { potegi[i] += potegi[i - 1] / 2; if (i > max_v && potegi[i] > 0) { max_v = i; } } if (potegi[max_v] > 1) { int temp = potegi[max_v]; while (temp > 1) { ++max_v; temp /= 2; } } cout << max_v; return 0; } |