#include "gap.h"
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using PP = pair<ll, P>;
const ll n_ = 2e5 + 10, inf = (ll)2e9 * (ll)1e9 + 7, mod = 998244353;
ll n, m, tc = 1, a, b, c, d, sum, x, y, z, base, ans, k;
ll findGap(int T, int N) {
vector<ll> res(N);
ll l = 0, r = 1e18, mn, mx, lidx = 0, ridx = N - 1;
for (int i = 0; i < (N + 1) / 2; i++) {
MinMax(l, r, &mn, &mx);
res[lidx++] = mn, res[ridx--] = mx;
l = mn + 1, r = mx - 1;
}
ll ret = 0;
for (int i = 1; i < N; i++)
ret = max(ret, res[i] - res[i - 1]);
return ret;
}
