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