#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
#define ll long long
#define pb push_back
#define rep(i,a,b) for(int i = a; i <= b; i++)
const int MAXN = 1e5+10;
ll a[MAXN];
mt19937_64 rng(392130);
vector<ll> dc(ll l, ll r) {
vector<ll> res;
ll s = l, t = r;
MinMax(s,t,&s,&t);
if(s==-1) {
// meh
}
else if(s==t) {
res.pb(s);
}
else {
uniform_int_distribution<ll> h(s,t-1);
ll mid = h(rng);
for(ll x : dc(s,mid)) res.pb(x);
for(ll x : dc(mid+1,t)) res.pb(x);
}
return res;
//hihiha
}
ll findGap(int T, int N)
{
vector<ll> a;
a = dc(0LL,(ll)1e18);
ll ans = 0;
rep(i,0,N-2) ans = max(ans, a[i+1]-a[i]);
return ans;
}
