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 ans=0ll;
//if(T==1){
long long l=0ll,r=1000000000000000000ll;
MinMax(l,r,&l,&r);
for(int x=0;x<n/2;x++){
long long newl=-1ll,newr=-1ll;
if(l+1ll<r-1ll)
MinMax(l+1ll,r-1ll,&newl,&newr);
if(newl!=-1ll){
ans=max(ans,max(l-newl,r-newr));
l=newl;
r=newr;
}
}
//}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |