#include <cstdio> #include <algorithm> int n, l, m; int t[201718 + 696969]; int main() { scanf("%d", &n); for (int i = 0; i < n; i++) { scanf("%d", &l); t[l]++; m = std::max(m, l); } int z = m; m = 0; l = 9999; int r = 0; for (int i = 1; (i <= z || l > 0); i++) { m = std::max(m, l = (t[i] += t[i - 1] / 2)); if (l) r = i; } printf("%d", r); 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 <cstdio> #include <algorithm> int n, l, m; int t[201718 + 696969]; int main() { scanf("%d", &n); for (int i = 0; i < n; i++) { scanf("%d", &l); t[l]++; m = std::max(m, l); } int z = m; m = 0; l = 9999; int r = 0; for (int i = 1; (i <= z || l > 0); i++) { m = std::max(m, l = (t[i] += t[i - 1] / 2)); if (l) r = i; } printf("%d", r); return 0; } |