#include <cstdio> using namespace std; const int MAX_POW = 201718; int pow_occ[MAX_POW+1]; int main() { int n; scanf("%d", &n); for(int i = 0; i < n; i++) { int x; scanf("%d", &x); pow_occ[x]++; } int max_pow = -1, curr_pow = 1, acc = 0; for(; curr_pow <= MAX_POW; curr_pow++) { acc /= 2; acc += pow_occ[curr_pow]; if(acc != 0) max_pow = curr_pow; } while(true) { acc /= 2; if(acc == 0) break; max_pow = curr_pow; curr_pow++; } printf("%d\n", max_pow); 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 | #include <cstdio> using namespace std; const int MAX_POW = 201718; int pow_occ[MAX_POW+1]; int main() { int n; scanf("%d", &n); for(int i = 0; i < n; i++) { int x; scanf("%d", &x); pow_occ[x]++; } int max_pow = -1, curr_pow = 1, acc = 0; for(; curr_pow <= MAX_POW; curr_pow++) { acc /= 2; acc += pow_occ[curr_pow]; if(acc != 0) max_pow = curr_pow; } while(true) { acc /= 2; if(acc == 0) break; max_pow = curr_pow; curr_pow++; } printf("%d\n", max_pow); return 0; } |