#include "gap.h"
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <iomanip>
typedef long long ll;
using namespace std;
long long findGap(int T, int N)
{
ll mini = -1, maxi = 1e18 + 79;
vector<ll> v(N);
for (int l = 0, r = N - 1; l <= r; l++, r--)
{
mini++, maxi--;
MinMax(mini, maxi, &mini, &maxi);
v[l] = mini;
v[r] = maxi;
}
ll ans = 0;
for (int i = 0; i < N - 1; i++) ans = max(ans, v[i + 1] - v[i]);
return ans;
}
