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 <bits/stdc++.h>
using namespace std;
#include "gap.h"
typedef long long ll;
typedef vector<ll>vl;
//#include "grader.cpp"
ll findGap(int T, int n){
vl a(n);
for(ll l=0,r=1e18,i=0; i<=n-i-1; i++){
ll mn=-1,mx=-1;
MinMax(l,r,&mn,&mx);
a[i]=mn,a[n-i-1]=mx;
l=mn+1,r=mx-1;
}
ll ans=0;
for(int i=0; i<n-1; i++)
ans=max(ans,a[i+1]-a[i]);
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |