#include "gap.h" #include<bits/stdc++.h> using namespace std; #define ll long long ll n,ans; ll findGap(int T, int N){ n=N; ll mn,mx; MinMax(0,1e18,&mn,&mx); ll grup=(mx-mn)/(n-1); ans=grup; ll satu,dua,lst; lst=mn; for(satu=mn+1,dua=mn+grup;satu<=mx;satu+=grup,dua+=grup){ dua=min(dua,mx); ll apa1,apa2; MinMax(satu,dua,&apa1,&apa2); if(apa1==-1)continue; ans=max(ans,apa1-lst); lst=apa2; } return ans; }