# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
741993 | vjudge1 | Gap (APIO16_gap) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
long long findGap(int T, int N){
long long l = 0, r = 1e18, L = 1, R = N;
long long a[N+1], mn, mx;
int cnt = 0;
while(L <= R){
cnt++;
MinMax(l, r, &mn, &mx);
a[L] = mn, a[R] = mx;
L++, R--;
l = mn+1;
r = mx-1;
}
if(cnt > (N+1)/2){
for(int i=1; i<=1e9; i++) cout << "WA";
}
long long ans = 0;
for(int i=2; i<=N; i++){
ans = max(ans, a[i] - a[i-1]);
}
return ans;
}