Submission #388981

#TimeUsernameProblemLanguageResultExecution timeMemory
388981David_MGap (APIO16_gap)C++14
0 / 100
67 ms1140 KiB
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll INF=1e18;
ll findGap(int T, int N){
	ll mn, mx;
	MinMax(0, INF, &mn, &mx);
	if(N==2)return mx-mn;
	ll l=mn, ans=(mx-mn)/((ll)N-1)-1, Ans=0, MX=mn;
	for (ll i=0; i<=N; i++)
		MinMax(l+1+i*ans, l+(i+1)*ans, &mn, &mx),
		Ans=max(Ans, mn-MX),
		MX=max(MX, mx);
	return Ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...