| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 984439 | THXuan | Gap (APIO16_gap) | C++14 | 0 ms | 0 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "gap.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
long long findGap(ll T, ll N)
{
	ll l = 0,r = 1e18;
	vector<ll>a;
	while(a.size() < N){
		ll mn,mx;
		MinMax(l,r,&mn,&mx);
		a.push_back(mn);
		if(mn == mx)break;
		a.push_back(mx);
		l = mn + 1;
		r = mx - 1;
		if(a.size() == N)break;
	}
	ll ans = 0;
	sort(a.begin(),a.end());
	for(int i=0;i+1<N;i++)ans = max(ans,a[i+1] - a[i]);
	return ans;
}
