#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){
ll mn,mx;
MinMax(0,1e18,&mn,&mx);
ll lower=(mx-mn+N-1-1)/N-1;
vector<ll> v;
v.push_back(mn);
v.push_back(mx);
for(int i=0;i<N;i++){
MinMax(i*lower+1,(i+1)*lower,&mn,&mx);
v.push_back(mn);
v.push_back(mx);
}
sort(v.begin(),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;
}*/
