//Krzysztof Pieprzak #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; typedef unsigned long long ull; typedef unsigned int uint; typedef vector<int> vi; typedef vector<ll> vll; typedef pair<int,int> pii; typedef pair<long long, long long> pll; typedef vector<pii> vpii; typedef vector<pll> vpll; #define Size(x) (int)x.size() #define VAR(v,n) auto v = (n) #define FOR(i,a,b) for(VAR(i,a); i < (b); ++i) #define FORE(i,a,b) for(VAR(i,a); i <= (b); ++i) #define FORREV(i,a,b) for(VAR(i,b); i >= (a); --i) #define FORSTEP(i,a,b,step) for(VAR(i,a); i < (b); i += (step)) #define FOREACH(i,c) for(auto i : (c)) #define FOREACHS(i,c,n) for(VAR(i,&(c)[0]); i-(c)<(n); ++i) #define ALL(x) x.begin(),x.end() #define CLEAR(t) memset(t, 0, sizeof(t)) #define F first #define S second #define MP make_pair #define PUB push_back #define POB pop_back #define pieprzu ios_base::sync_with_stdio(0); const int INF = 1000000001; const double EPS = 10e-9; const int MAXN = 1000000; const int MAXA = 201718; int N; int cnts[MAXA + 10]; int getLog(int x) { int res = 0; for (; x > 1; x >>= 1, ++res); return res; } void rob(int test) { scanf("%d", &N); int a, mxA = 0; FOR (i, 0, N) { scanf("%d", &a); ++cnts[a]; mxA = max(mxA, a); } FOR (i, 0, mxA) { cnts[i + 1] += (cnts[i] >> 1); } printf("%d", mxA + getLog(cnts[mxA])); } int main() { int test = 1; //scanf("%d", &test); FORE (i, 1, test) rob(i); 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 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 | //Krzysztof Pieprzak #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; typedef unsigned long long ull; typedef unsigned int uint; typedef vector<int> vi; typedef vector<ll> vll; typedef pair<int,int> pii; typedef pair<long long, long long> pll; typedef vector<pii> vpii; typedef vector<pll> vpll; #define Size(x) (int)x.size() #define VAR(v,n) auto v = (n) #define FOR(i,a,b) for(VAR(i,a); i < (b); ++i) #define FORE(i,a,b) for(VAR(i,a); i <= (b); ++i) #define FORREV(i,a,b) for(VAR(i,b); i >= (a); --i) #define FORSTEP(i,a,b,step) for(VAR(i,a); i < (b); i += (step)) #define FOREACH(i,c) for(auto i : (c)) #define FOREACHS(i,c,n) for(VAR(i,&(c)[0]); i-(c)<(n); ++i) #define ALL(x) x.begin(),x.end() #define CLEAR(t) memset(t, 0, sizeof(t)) #define F first #define S second #define MP make_pair #define PUB push_back #define POB pop_back #define pieprzu ios_base::sync_with_stdio(0); const int INF = 1000000001; const double EPS = 10e-9; const int MAXN = 1000000; const int MAXA = 201718; int N; int cnts[MAXA + 10]; int getLog(int x) { int res = 0; for (; x > 1; x >>= 1, ++res); return res; } void rob(int test) { scanf("%d", &N); int a, mxA = 0; FOR (i, 0, N) { scanf("%d", &a); ++cnts[a]; mxA = max(mxA, a); } FOR (i, 0, mxA) { cnts[i + 1] += (cnts[i] >> 1); } printf("%d", mxA + getLog(cnts[mxA])); } int main() { int test = 1; //scanf("%d", &test); FORE (i, 1, test) rob(i); return 0; } |