# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
388966 | David_M | 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"
#define ll long long
const ll INF=1e18;
ll findGap(int T, int N){
ll mn, mx;
MinMax(0, INF, &mn, &mx);
ll l=mn, r=mx, ans=(mx-mn)/(N-1)-1, Ans=0, MX=mn;
for (int i=0; i<N; i++)
MinMax(l+1+i*ans, l+1+(i+1)*ans, &mn, &mx),
Ans=max(Ans, mn-MX),
MX=max(MX, mx);
return Ans;
}