# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
569024 | 2022-05-26T13:38:45 Z | BadPenalty | Gap (APIO16_gap) | C++14 | 0 ms | 0 KB |
//#include "gap.h" #include "bits/stdc++.h" using namespace std; long long findGap(int T, int N) { vector<long long>ll(N+10); long long a = 0,b = 1e18; for(int i = 1;i<=N;i++) { if(ll[i])break; MinMax(a,b,&a,&b); ll[i] = a,ll[N-i+1] = b; a++,b--; } long long ans = 0; for(int i = 2;i<=N;i++) { ans = max(ans,ll[i]-ll[i-1]); } return ans; }