#include <iostream> using namespace std; #define MAXN 1000002 #define MAXA 201740 int coins[MAXN]; int howMany[MAXA]; int main() { ios_base::sync_with_stdio(false); int n; cin >> n; for (int k = 0; k < n; ++k) { cin >> coins[k]; } int max = 0; for (int i = 0; i < n; ++i) { howMany[coins[i]]++; } for (int j = 0; j < MAXA; ++j) { if(howMany[j] > 0) { max = j; } if(howMany[j] > 1) { howMany[j+1] += howMany[j]/2; } } cout << max << endl; 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 | #include <iostream> using namespace std; #define MAXN 1000002 #define MAXA 201740 int coins[MAXN]; int howMany[MAXA]; int main() { ios_base::sync_with_stdio(false); int n; cin >> n; for (int k = 0; k < n; ++k) { cin >> coins[k]; } int max = 0; for (int i = 0; i < n; ++i) { howMany[coins[i]]++; } for (int j = 0; j < MAXA; ++j) { if(howMany[j] > 0) { max = j; } if(howMany[j] > 1) { howMany[j+1] += howMany[j]/2; } } cout << max << endl; return 0; } |