#include "gap.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ordered_set <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ordered_multiset <int, null_type, less_equal <int>, rb_tree_tag, tree_order_statistics_node_update>
#define int long long
#define double long double
#define pii pair <int, int>
#define tiii tuple <int, int, int>
#define tiiii tuple <int, int, int, int>
#define emb emplace_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define iShowSpeed cin.tie(NULL)->sync_with_stdio(false)
#define matrix vector <vector <int>>
#define mat(n, m) vector <vector <int>> (n, vector <int> (m));
const int mod = 1e9 + 7;
const int inf = 1e18;
const matrix II = {{1, 0}, {0, 1}};
const int N = 2e5 + 5;
long long findGap(int32_t t, int32_t n)
{
if (t == 1) {
int l = 1, r = inf;
vector <int> a(n + 2);
int idx = 1;
while (l < r) {
if (idx > (n + 1) / 2) break;
int mn, mx;
MinMax(l, r, &mn, &mx);
if (mn == mx) a[idx] = mn;
else a[idx] = mn, a[n - idx + 1] = mx;
l = mn+1, r = mx-1;
idx++;
}
int ans = 0;
for (int i = 1; i + 1 <= n; i++) ans = max(ans, a[i + 1] - a[i]);
return ans;
}
else {
int l = 0, r = inf;
int realmn, realmx;
MinMax(l, r, &realmn, &realmx);
int len = (realmx - realmn + n - 2) / (n - 1);
int idx = realmn;
int prev = realmn;
int ans = 0;
while (idx <= realmx) {
int mn, mx;
MinMax(idx, idx + len, &mn, &mx);
if (mn != -1) {
ans = max(ans, mn - prev);
prev = mx;
}
idx = idx + len + 1;
}
return ans;
}
}
