# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1168191 | stdfloat | Gap (APIO16_gap) | C++17 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include "gap.h"
#include "grader.cpp"
using namespace std;
using ll = long long;
ll findGap(int T, int n) {
ll s = LLONG_MIN, t = LLONG_MAX, mx = 0;
for (int i = 0; i < ((n + 1) >> 1); i++) {
ll x, y;
MinMax(s + 1, t - 1, &x, &y);
if (i) mx = max({mx, x - s, t - y});
s = x; t = y;
}
return max(mx, t - s);
}