# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1012016 | codefox | Gap (APIO16_gap) | C++17 | 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
long long findGap(int T, int N)
{
ll l = 0;
ll r = 1e18;
int mxdist = 0;
ll nl = 0;
ll nr = 0;
ll fl = -1;
ll fr = -1;
while (nl != -1 && l <= r)
{
MinMax(l, r, std::ref(nl), std::ref(nr));
if (fl != -1) mxdist = std::max(mxdist, nl-fl);
if (fr != -1) mxdist = std::max(mxdist, fr-nr);
fl = nl;
fr = nr;
l = nl+1;
r = nr-1;
}
mxdist = std::max(mxdist, fr-fl);
return mxdist;
return 0;
}