#include<bits/stdc++.h>
#include "gap.h"
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 6;
ll a[maxn];
long long findGap(int T, int N)
{
int n = N;
if(T == 1){
ll u = 0 - 1 , v = (ll)1e18 + 1;
for(int i = 1 , j = n ; i <= j ; ++i , --j){
MinMax(u + 1 , v - 1 , &a[i] , &a[j]);
u = a[i] , v = a[j];
}
ll res = 0;
for(int i = 2 ; i <= n ; ++i){
res = max(res , a[i] - a[i - 1]);
}
return res;
}
else{
ll u = 0 , v = 1e18;
MinMax(u , v , &u , &v);
ll gap = (v - u) / (n - 1);
a[1] = u;
ll res = gap;
vector<ll> val = {u , v};
for( ; u < v ; u += gap + 1){
ll x , y;MinMax(u , u + gap , &x, &y);
if(x == -1)continue;
val.push_back(x);
val.push_back(y);
}
sort(val.begin(),val.end());
for(int i = 1 ; i < (int)val.size() ; ++i)res = max(res , val[i] - val[i - 1]);
return res;
}
}
