# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
32255 | dqhungdl | Gap (APIO16_gap) | C++14 | 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 <bits/stdc++.h>
#include "gap.h";
using namespace std;
long long a[100005];
long long findGap(int T, int n)
{
if(T==1)
{
long long L,R,res=1e18,preL=-1,preR=1e18+1;
while(1)
{
MinMax(preL+1,preR-1,L,R);
res=max(res,max(L-preL,preR-R));
L=preL;
R=preR;
if(L==-1||L==R)
break;
}
return res;
}
}