#include <bits/stdc++.h>
#pragma GCC optimize ("trapv")
#include "gap.h"
using namespace std;
typedef long long ll;
const ll inf = 1e18;
pair <ll, ll> ask (ll l, ll r) {
if (l > r) return {-1, -1};
ll mn = l, mx = r;
MinMax(l, r, &mn, &mx);
return {mn, mx};
}
ll findGap (int t, int n) {
if (t == 1) {
auto g = ask(0, inf); n -= 2;
if (!n) {
return g.second - g.first;
}
ll ans = 0;
while (n >= 1) {
auto h = ask(g.first + 1, g.second - 1);
if (h.first == -1) {
ans = max(ans, g.second - g.first);
break;
}
assert(g.first < h.first && h.first <= h.second && h.second < g.second);
ans = max(ans, g.second - h.second);
ans = max(ans, h.first - g.first);
g = h;
n -= 2;
}
return ans;
}
auto g = ask(0, inf);
ll L = g.second - g.first + 1;
ll x = (L + n - 2) / (n - 1);
ll ans = x;
vector <pair <ll, ll>> dd;
for (ll i = g.first; i + x <= g.second; i += x + 1) {
auto h = ask(i, min(g.second, i + x));
if (h.first != -1) dd.push_back(h);
}
for (int i = 1; i < (int)dd.size(); i++) ans = max(ans, dd[i].first - dd[i - 1].second);
return ans;
}
