# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
39587 | igzi | 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>
long long findGap(int t,long long n){
long long l=0,d=n,x=-1,y=1e18+1,a[maxN],m=0;
for(int i=0;i<n;i++){
a[i]=-1;
}
while(y!=-1){
MinMax(x+1,y-1,&x,&y);
a[l]=x;
a[d]=y;
l++; d++;
}
for(int i=1;i<n;i++){
if(a[i]!=-1 && a[i-1]!=-1 && a[i]-a[i-1]>m) m=a[i]-a[i-1];
}
return m;
}