This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "gap.h"
#include<bits/stdc++.h>
using namespace std;
long long findGap(int T, int N){
long long l = 0, r = 1e18, L = 1, R = N;
long long a[N+1], mn, mx;
while(l <= r){
MinMax(l, r, &mn, &mx);
if(mn == -1 && mx == -1) break;
a[L] = mn, a[R] = mx;
L++, R--;
l = mn+1;
r = mx-1;
}
long long ans = 0;
for(int i=2; i<=N; i++){
ans = max(ans, a[i] - a[i-1]);
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |