# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
105994 | daniel920712 | 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 "gap.h"
using namespace std;
long long all[100005];
long long findGap(long long T,long long N)
{
long long a,b,l=0,r=N-1,x=0,y=1e9,ans=0,i;
while(l<=r)
{
MinMax(x,y,&a,&b);
all[l]=a;
all[r]=b;
x=a+1;
y=b-1;
}
for(i=1;i<N;i++) ans=max(ans,all[i]-all[i-1]);
return ans;
}