#include <bits/stdc++.h> using namespace std; const int N = 500000; int cnt[N]; int n, x; int main() { scanf("%d", &n); int mx = 0; for (int i = 1; i <= n; i++) { scanf("%d", &x); cnt[x]++; mx = max(mx, x); } int ans = 0; for (int i = 0; i <= mx + 50; i++) { cnt[i + 1] += cnt[i] / 2; cnt[i] %= 2; if (cnt[i] > 0) { ans = i; } } printf("%d\n", ans); 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 | #include <bits/stdc++.h> using namespace std; const int N = 500000; int cnt[N]; int n, x; int main() { scanf("%d", &n); int mx = 0; for (int i = 1; i <= n; i++) { scanf("%d", &x); cnt[x]++; mx = max(mx, x); } int ans = 0; for (int i = 0; i <= mx + 50; i++) { cnt[i + 1] += cnt[i] / 2; cnt[i] %= 2; if (cnt[i] > 0) { ans = i; } } printf("%d\n", ans); return 0; } |