#include <bits/stdc++.h> using namespace std; int ile[250000], wyn, a, n; int main() { scanf("%d", &n); for (int i = 1; i <= n; i++) scanf("%d", &a), ile[a]++; for (int i = 0; i < 250000; i++) { ile[i + 1] += (ile[i]/2); ile[i] -= ((ile[i]/2) * 2); if (ile[i] >= 1) wyn = max(wyn, i); } printf("%d", wyn); }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 | #include <bits/stdc++.h> using namespace std; int ile[250000], wyn, a, n; int main() { scanf("%d", &n); for (int i = 1; i <= n; i++) scanf("%d", &a), ile[a]++; for (int i = 0; i < 250000; i++) { ile[i + 1] += (ile[i]/2); ile[i] -= ((ile[i]/2) * 2); if (ile[i] >= 1) wyn = max(wyn, i); } printf("%d", wyn); } |