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"
using namespace std;
long long findGap(int t,int n){
if(t==1){
long long l=0,d=n+1,a[100005],m=0,i;
for(i=0;i<n;i++){
a[i]=-5;
}
a[0]=-1;
a[n+1]=1000000000000000005;
for(i=1;i<=(n+1)/2;i++){
MinMax(a[l]+1,a[d]-1,&a[l+1],&a[d-1]);
l++; d--;
}
for(i=2;i<=l;i++){
m=max(m,a[i]-a[i-1]);
}
if(l+1==d) m=max(m,a[d]-a[l]);
for(i=d+1;i<n+1;i++){
m=max(m,a[i]-a[i-1]);
}
return m;}
else{
long long a,b,ans,last,s,e;
MinMax(-1,1000000000000000005,&a,&b);
last=a;
if(n==2) return b-a;
long long d=(b-a-2)/(n-1);
ans=d;
for(s=a+1,e=a+d+1;e<b+d+1;s+=d+1,e+=d+1){
long long mi,ma;
if(e>=b) break;
MinMax(s,e,&mi,&ma);
if(mi!=-1){
ans=max(ans,mi-last);
last=ma;
}
}
long long mi,ma;
MinMax(s,e,&mi,&ma);
if(mi==ma) ans=max(ans,b-last);
else ans=max(ans,ma-mi);
return ans;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |