#include "gap.h"
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <set>
#include <iterator>
#include <stack>
#include <map>
#include <math.h>
#include <bitset>
#include <deque>
#include <string>
#include <tuple>
#include <queue>
#include <numeric>
#include <complex>
#include <assert.h>
#include <unordered_set>
#include <unordered_map>
using namespace std;
#define ll long long
#define rep(i, a, b) for (long long i = a; i <= b; i++)
#define sz(x) (ll) (x).size ()
long long findGap(int T, int N)
{
ll lo=0;
ll hi=1e18;
vector <ll> f,r;
ll cnt=0;
while(cnt<N)
{
ll mn,mx;
MinMax(lo,hi,&mn,&mx);
if(cnt+1==N)
{
f.push_back(mn);
cnt+=1;
}
else
{
f.push_back(mn);
r.push_back(mx);
cnt+=2;
}
}
vector <ll> v;
for(auto x:f)
v.push_back(x);
reverse(r.begin(),r.end());
for(auto x:r)
v.push_back(x);
ll ans=0;
rep(i,0,sz(v)-2)
ans=max(ans,v[i+1]-v[i]);
return ans;
}
