# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1012022 | 2024-07-01T14:30:07 Z | codefox | Gap (APIO16_gap) | C++14 | 0 ms | 0 KB |
#include "gap.h" #define ll long long using namespace std; long long findGap(int T, int N) { ll l = 0; ll r = 1e18; ll mxdist = 0; ll nl = 0; ll nr = 0; ll fl = -1; ll fr = -1; while (nl != -1 && l <= r) { MinMax(l, r, &nl, &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; }