# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1084420 | MMihalev | 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<iostream>
#include<algorithm>
#include "gap.h"
using namespace std;
__int64 mn,mx;
__int64 findGap(int T,long int N)
{
__int64 l=-1,r=1000000000000000001LL;
long int rem=N;
__int64 ans=1;
while(rem>0)
{
MinMax(l+1,r-1,&mn,&mx);
if(rem==2)ans=max(ans,mx-mn);
if(l!=-1)
{
ans=max(ans,mn-l);
ans=max(ans,r-mx);
}
if(mn!=mx)rem-=2;
else rem--;
l=mn;
r=mx;
}
return ans;
}