#include <cstdlib> #include <cstdio> #include <algorithm> using namespace std; const int d = 30; int A[201718+d]; int main() { int n; scanf("%d", &n); int maxA = 0; for(int i = 0; i < n; ++i) { int a; scanf("%d", &a); ++A[a]; maxA = max(a, maxA); } for(int i = 0; i <= maxA; ++i) { if(i == maxA && A[i] > 1) ++maxA; A[i+1] += A[i]/2; } printf("%d\n", maxA); 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 | #include <cstdlib> #include <cstdio> #include <algorithm> using namespace std; const int d = 30; int A[201718+d]; int main() { int n; scanf("%d", &n); int maxA = 0; for(int i = 0; i < n; ++i) { int a; scanf("%d", &a); ++A[a]; maxA = max(a, maxA); } for(int i = 0; i <= maxA; ++i) { if(i == maxA && A[i] > 1) ++maxA; A[i+1] += A[i]/2; } printf("%d\n", maxA); return 0; } |