#include <cstdio> #include <vector> #include <map> using namespace std; int n,a; bool t[300000]; int main() { scanf("%d", &n); for (int i = 0; i < n; ++i) { scanf("%d", &a); int j = a; while (t[j] == true) { t[j] = false; j++; } t[j] = true; } int max = 0; for (int i = 0; i < 300000; ++i) { if (t[i] == true) { max = i; } } printf("%d", max); 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 40 | #include <cstdio> #include <vector> #include <map> using namespace std; int n,a; bool t[300000]; int main() { scanf("%d", &n); for (int i = 0; i < n; ++i) { scanf("%d", &a); int j = a; while (t[j] == true) { t[j] = false; j++; } t[j] = true; } int max = 0; for (int i = 0; i < 300000; ++i) { if (t[i] == true) { max = i; } } printf("%d", max); return 0; } |