| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1257191 | MasterDebater | Gap (APIO16_gap) | C++20 | 0 ms | 0 KiB | 
#include "gap.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=1e5+10;
ll ans,a[N];
ll findGap(ll T,ll N){
	if(T==1){
		ll li=1,int ri=N;
		a[N+1]=1e18;
		while(ri-li>=0){
			MinMax(a[li-1]+1,a[ri+1]-1,&a[li],&a[ri]);
			li++,ri--;
		}
		for(int i=1;i<N;i++)ans=max(ans,a[i+1]-a[i]);
	}
	else{
		ll mn,mx;
		MinMax(0,1e18,&mn,&mx);
		ll x=(mx-mn+N-2)/(N-1);
		ll ans=x,l,r,p=mn,i;
		for(i=mn;i+x<mx;i+=x+1){
			MinMax(i,i+x,&l,&r);
			if(l!=-1)ans=max(ans,l-p),p=l;	
		}
		MinMax(i,mx,&l,&r);
		if(l!=-1)ans=max(ans,l-p);
	}
	return ans;
}
