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 findGap(int t,int n){
long long l=1,d=n-2,x=0,y=1000000000000000005,a[100002],m=0,i;
for(i=0;i<n;i++){
a[i]=-5;
}
MinMax(x,y,&a[0],&a[n-1]);
for(i=1;i<=(n+1)/2;i++){
MinMax(a[l-1]+1,a[d+1]-1,&a[l],&a[d]);
l++; d--;
}
for(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;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |