# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
520347 | krit3379 | Gap (APIO16_gap) | C++17 | 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>
using namespace std;
#include "gap.h"
#define N 100005
long long a[N],l,r,ma,mi,ans;
long long findGap(int t,int n){
int i,j;
if(t==1){
l=0,r=1e18;
for(i=1,j=n;i<=j;i++,j--){
MinMax(l,r,mi,ma);
a[i++]=mi;
a[j--]=ma;
}
for(i=1;i<n;i++)ans=max(ans,a[i+1]-a[i]);
return ans;
}
}