# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
102805 | alexpetrescu | 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 <algorithm>
#include "gap.h"
long long findGap(int T, int N) {
long long R = 1000000000000000000LL;
long long e, r;
MinMax(0, R, &e, &r);
r -= e;
long long dist = (r + N - 2) / (N - 1), st = e, ans = 0, val = -1;
std::vector < int > q;
for (int i = 1; i < N; i++) {
long long a, b;
MinMax(st, st + dist, &a, &b);
st += dist + 1;
if (a != -1) {
if (val != -1)
ans = std::max(ans, a - val);
val = b;
}
}
return ans;
}