| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 560778 | abcvuitunggio | Gap (APIO16_gap) | C++17 | 0 ms | 0 KiB |
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 f(long long l, long long r){
if (l>=r)
return -1;
long long mn,mx,mid=(l+r)>>1;
MinMax(l,mid,&mn,&mx);
if (mn==-1)
return f(mid+1,r);
long long x=mx;
MinMax(mid+1,r,&mn,&mx);
if (mn==-1)
return f(l,mid);
return max(max(mn-x,f(l,mid)),f(mid+1,r));
}
long long findGap(long long T, long long N)
{
long long a[N],lo=0,hi=1000000000000000000,res=0;
if (T==1){
for (int i=0;i<N&&i<=N-i-1;i++){
MinMax(lo,hi,&a[i],&a[N-i-1]);
lo=a[i]+1;
hi=a[N-i-1]-1;
}
for (long long i=0;i<N-1;i++)
res=max(res,a[i+1]-a[i]);
return res;
}
return f(lo,hi);
}