#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
bool chmax(ll &a, const ll &b) {
return a < b ? a = b, true : false;
}
long long findGap(int T, int n) {
if(T == 1) {
ll lmn = -1, lmx = 1e18 + 1;
ll ans = 0;
for(int i = 0; i < (n + 1) / 2; i++) {
ll cmn, cmx;
// assert(lmn + 1 <= lmx - 1);
MinMax(lmn + 1, lmx - 1, &cmn, &cmx);
if(i > 0) {
// assert(cmn != -1 && cmx != -1 && lmn != -1 && lmx != -1);
chmax(ans, cmn - lmn);
chmax(ans, lmx - cmx);
}
lmn = cmn, lmx = cmx;
}
assert(lmn != -1);
chmax(ans, lmx - lmn);
return ans;
} else {
ll L, R;
MinMax(0, 1e18, &L, &R);
ll dif = R - L+1;
ll lmn = L, lmx = L;
ll B = dif / n;
ll ans = B;
for(int i = 0; 1; i++) {
ll cl = i * B + L, cr = min(L + (i + 1) * B - 1, R);
if(cl>R)break;
ll mn, mx;
MinMax(cl, cr, &mn, &mx);
// cout << cl << ' ' << cr << ' ' << mn << ' ' << mx << '\n';
if(lmn != -1 && mn != -1) {
chmax(ans, mn - lmx);
}
if(mn != -1) {
lmn = mn, lmx = mx;
}
}
return ans;
}
}
