# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1084403 | 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<cmath>
#include "gap.h"
using namespace std;
long long Mi,Ma;
long long findGap(int T, int N)
{
if(T>=1)
{
long long l=0,r=1000000000000000000LL,prevMi=-1,prevMa=-1;
long long ans=0;
int rem=N;
while(rem>0)
{
MinMax(l,r,Mi,Ma);
if(rem==2)ans=max(ans,Mi-Ma);
if(prevMi!=-1)
{
ans=max(ans,Mi-prevMi);
ans=max(ans,prevMa-Ma);
}
if(Mi!=Ma)rem-=2;
else rem--;
prevMi=Mi;
prevMa=Ma;
}
return ans;
}
else
{
}
}