#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "gap.h"
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 gen(std :: chrono :: system_clock :: now().time_since_epoch().count());
long long a[1000010];
long long findGap(int T, int n) {
if (T == 1) {
long long L = 0, R = 1e18;
int lhs = 1, rhs = n;
while (lhs <= rhs) {
long long temp1 = 0, temp2 = 0;
long long *nL = &temp1, *nR = &temp2;
MinMax(L, R, nL, nR);
L = *nL, R = *nR;
a[lhs] = L, a[rhs] = R;
++L, --R;
++lhs, --rhs;
}
long long ans = 0;
for (int i = 1; i < n; ++i) ans = max(ans, a[i + 1] - a[i]);
return ans;
} else {
long long L = 0, R = 1e18, x, y;
MinMax(L, R, &x, &y);
L = x, R = y;
vector <long long> a;
long long gap = (R - L) / (n - 1);
for (; L <= R; L += gap) {
long long x, y;
MinMax(L, L + gap - 1, &x, &y);
if (x != -1 && y != -1) a.push_back(x), a.push_back(y);
}
long long ans = 0;
for (int i = 1; i < a.size(); ++i) ans = max(ans, a[i] - a[i - 1]);
return ans;
}
}
