#include <bits/stdc++.h> #include "gap.h" using namespace std; using ll = long long; long long findGap(int T, int N) { vector<ll> a(N); if(T == 1) { ll l = 0, r = 1e18; int i = 0, j = N - 1; while(i <= j) { ll mn, mx; MinMax(l, r, &mn, &mx); a[i] = mn; a[j] = mx; l = mn + 1; r = mx - 1; ++i; --j; } } ll ans = 0; for(int i=0;i<N-1;++i) ans = max(ans, a[i + 1] - a[i]); return ans; }