#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];
ll findGap(int T, int N)
{
vector<ll> a;
ll s = 0, t = 1e18;
MinMax(s,t,&s,&t);
ll ans = (t-s+1)/N;
vector<ll> imp;
ll s1 = s, t1 = s+ans;
while (t1 <= t) {
ll tmp = t1;
MinMax(s1,t1,&s1,&t1);
if(s1!=-1)imp.pb(s1);
if(t1!=-1)imp.pb(t1);
s1 = tmp+1;
t1 = s1+ans;
}
imp.pb(t);
rep(i,0,imp.size()-2) {
ans = max(ans, imp[i+1]-imp[i]);
}
return ans;
}
