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 <algorithm>
using namespace std;
long long findGap(int T, int N){
long long arr[N];
for(int i=0;i<(N+1)/2;i++){
long long s=0, t=1000000000000000000, mn, mx;
MinMax(s, t, &mn, &mx);
arr[i]=mn;
s=mn+1;
arr[N-1-i]=mx;
t=mx-1;
}
long long diff=0;
for(int i=1;i<N;i++){
diff=max(diff, arr[i]-arr[i-1]);
}
return diff;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |