#include<iostream>
#include<algorithm>
#include<vector>
#include"gap.h"
using namespace std;
typedef long long ll;
#define chmin(a,b) a=min(a,b)
#define chmax(a,b) a=max(a,b)
#define rep(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
#define mad(a,b) a=(a+b)%mod
/*
ll a[100010],n,m;
void MinMax(ll s,ll t,ll &mn,ll &mx){
m++;
ll l,r,mid;
l=-1,r=n;
while(l<r-1){
mid=(l+r)>>1;
if(a[mid]>=s)r=mid;
else l=mid;
}
mn=a[r];
l=-1,r=n;
while(l<r-1){
mid=(l+r)>>1;
if(a[mid]<=t)l=mid;
else r=mid;
}
mx=a[l];
}*/
ll findGap(int T,int N){
if(T==1){
ll A[100010];
A[0]=-1,A[N+1]=2e18;
ll l=0,r=N+1;
while(l+1<=r-1){
ll mn,mx;
MinMax(A[l]+1,A[r]-1,&mn,&mx);
l++,r--;
A[l]=mn,A[r]=mx;
}
ll ans=0;
for(int i=1;i<=N-1;i++)ans=max(ans,A[i+1]-A[i]);
return ans;
}
ll mn,mx;
ll a,b;
MinMax(0,1e18,&a,&b);
ll lower=(b-a+N-1-1)/(N-1);
vector<ll> v;
v.push_back(a);
v.push_back(b);
for(int i=0;i<N;i++){
MinMax(a+i*lower+1,a+(i+1)*lower,&mn,&mx);
if(mn>=0)v.push_back(mn);
if(mx>=0)v.push_back(mx);
}
sort(v.begin(),v.end());
v.erase(unique(v.begin(),v.end()),v.end());
ll ans=0;
rep(i,v.size()-1)ans=max(ans,v[i+1]-v[i]);
return ans;
}
/*
int main(){
n=100000;
rep(i,n)a[i]=rand()%mod;
sort(a,a+n);
ll ans=0;
rep(i,n-1)chmax(ans,a[i+1]-a[i]);
m=0;
cout<<ans<<endl;
cout<<findGap(0,n)<<endl;
cout<<"m="<<m<<endl;
}*/
