#include "gap.h"
#include <bits/stdc++.h>
#define ll long long
long long findGap(int T, int N)
{
if(T==1){
std::vector<ll> left;
std::vector<ll> right;
ll v1=0-1,v2=1e18+1;
while(left.size()+right.size()<N&&v1!=v2){
MinMax(v1+1,v2-1,&v1,&v2);
if(v1==-1 || v2==-1)break;
left.push_back(v1);
right.push_back(v2);
}
ll best=0;
for(int i=0;i<left.size()-1;i++){
ll diff = std::abs(left[i+1]-left[i]);
best=std::max(diff,best);
}
for(int i=0;i<right.size()-1;i++){
ll diff = std::abs(right[i+1]-right[i]);
best=std::max(diff,best);
}
best=std::max(best,std::abs(right.back()-left.back()));
return best;
}
else{
ll v1=0-1,v2=1e18+1,high=0,low=0;
MinMax(v1+1,v2-1,&v1,&v2);
high=v2;low=v1;
ll dis = v2-v1;
ll meandis = (dis/N) + 1;
ll test1 =v1+1,test2 = v1+meandis;
ll last=v1;
ll best = 0;
while(test1<high){
MinMax(test1,test2,&v1,&v2);
best=std::max(best,v1-last);
last=v2;
//best=std::max(best,v2-v1);// not really needed
test1+=meandis;
test2+=meandis;
}
best=std::max(best,high-v2);
return best;
}
return 0;
}
