#include <cstdio> #include <cstdlib> #include <cstring> #include <iostream> #include <algorithm> typedef long long ll; const int N = 2.5e5 + 5; using namespace std; int n, x, ans, a[N]; int main() { for (scanf("%d", &n); n; n--) { scanf("%d", &x); a[x]++; } for (int i = 0; i < N - 5; i++) { a[i + 1] += a[i] / 2; if (a[i]) ans = i; } printf("%d\n", ans); }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 | #include <cstdio> #include <cstdlib> #include <cstring> #include <iostream> #include <algorithm> typedef long long ll; const int N = 2.5e5 + 5; using namespace std; int n, x, ans, a[N]; int main() { for (scanf("%d", &n); n; n--) { scanf("%d", &x); a[x]++; } for (int i = 0; i < N - 5; i++) { a[i + 1] += a[i] / 2; if (a[i]) ans = i; } printf("%d\n", ans); } |