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;
typedef long long ll;
ll a[100005];
ll findGap(int T,int N){
int l=0,r=N-1;ll cl=0,cr=1e18,mn,mx;
while(l<=r){
MinMax(cl,cr,&mn,&mx);
a[l]=mn,a[r]=mx,cl=mn+1,cr=mx-1,++l,--r;
}
ll ans=0;
for(int i=1;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... |