#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
typedef long long ll;
vector<ll> ans;
ll findGap(int t, int n){
if(t == 1){
int L = 0, R = n - 1;
ll val_l = 1, val_r = 1e18;
while(L <= R){
MinMax(val_l, val_r, &val_l, &val_r);
ans.push_back(val_l);
if(val_r != val_l) ans.push_back(val_r);
++L; --R;
++val_l; --val_r;
}
} else {
ll L = 0, R = 1e18;
MinMax(L, R, &L, &R);
ans.push_back(L); ans.push_back(R);
ll block = (R - L + n - 2) / (n - 1);
for(ll i = L + 1; i < R; i += block + 1){
ll val_l = i, val_r = min(R - 1, i + block);
MinMax(val_l, val_r, &val_l, &val_r);
if(val_l != -1){
ans.push_back(val_l);
ans.push_back(val_r);
}
}
}
ll ret = 0;
sort(ans.begin(), ans.end());
for(int i = 0; i < (int)ans.size() - 1; ++i) ret = max(ret, ans[i + 1] - ans[i]);
return ret;
}
