#include <iostream>
#include "gap.h"
using namespace std;
long long int a[200005], z = 0;
long long int findGap(int t, int n) {
if (t == 1) {
long long int x = 0, y = 1e18, l = 1, r = n, ma = 0;
while (l <= r) {
MinMax(x, y, &x, &y);
a[l] = x; a[r] = y;
l++;
r--;
x++;
y--;
}
ma = 0;
for (int i = 2; i <= n; i++) {
ma = max(ma, a[i] - a[i - 1]);
}
return ma;
}
long long int mi, ma, x, y;
MinMax(0, 1e18, &mi, &ma);
long long int h = (ma - mi + n - 2) / (n - 1);
a[++z] = mi;
mi++;
while (1) {
MinMax(mi, mi + h - 1, &x, &y);
if (x != -1) {
a[++z] = x;
a[++z] = y;
}
mi += h;
if (mi > ma) break;
}
ma = 0;
for (int i = 2; i <= z; i++) {
ma = max(ma, a[i] - a[i - 1]);
}
return ma;
}
