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,ans;
long long *ma,*mi;
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;
l=*mi+1;
r=*ma-1;
}
for(i=1;i<n;i++)ans=max(ans,a[i+1]-a[i]);
return ans;
}
}
Compilation message (stderr)
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:24:1: warning: control reaches end of non-void function [-Wreturn-type]
24 | }
| ^
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |