/* Rozwiazanie zadania Skarbonka */ /* Autor: Kamil Kurowski */ #include <iostream> using namespace std; const int MX = 2000000; int tab[MX + 9]; int n, mx; int main() { ios_base :: sync_with_stdio(0); for(int i = 0; i <= MX; ++i) tab[i] = 0; int x; mx = 0; cin >> n; while(n--) { cin >> x; ++tab[x]; while(tab[x] > 1) { tab[x] = 0; ++tab[x + 1]; ++x; } while(tab[x] == 0) --x; if(x > mx) mx = x; } cout << mx << 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 34 35 36 37 38 39 40 41 42 | /* Rozwiazanie zadania Skarbonka */ /* Autor: Kamil Kurowski */ #include <iostream> using namespace std; const int MX = 2000000; int tab[MX + 9]; int n, mx; int main() { ios_base :: sync_with_stdio(0); for(int i = 0; i <= MX; ++i) tab[i] = 0; int x; mx = 0; cin >> n; while(n--) { cin >> x; ++tab[x]; while(tab[x] > 1) { tab[x] = 0; ++tab[x + 1]; ++x; } while(tab[x] == 0) --x; if(x > mx) mx = x; } cout << mx << endl; return 0; } |