#include "gap.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
long long findGap(int T, int N)
{
ll tempa = 0;
ll tempb = 1e18;
ll arr[N];
ll l = 0;
ll r = N-1;
// cout<<tempa<< " " << tempb<<endl;
while(true){
ll mn, mx;
MinMax(tempa, (ll)(tempb), &mn, &mx);
// cout<<mn<<" "<<mx<<endl;
if(mn==-1 || mx==-1){
break;
} else if(mn==mx){
arr[l] = mn;
break;
} else {
tempa = mn+1;
tempb = mx-1;
arr[l] = mn;
arr[r] = mx;
l++;
r--;
}
}
ll ans = 0;
for(int i=1; i<N; i++){
ll temp = arr[i]-arr[i-1];
ans = max(temp, ans);
}
return ans;
}
