# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1084160 | 2024-09-05T13:12:22 Z | Timosh | Gap (APIO16_gap) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; #define ll long long ll findGap(int T, ll n) { vector<ll> a, b; ll l = 0, r = 1e18; int mn, mx; while (l <= r) { MinMax(l, r, mn, mx); if (mx == -1) break; a.push_back(mn); b.push_back(mx); l = mn + 1, r = mx - 1; } reverse(b.begin(), b.end()); ll ans = 0; int last = a[0]; for (auto &i : a) { ans = max(ans, i - last); last = i; } for (auto &i : b) { ans = max(ans, i - last); last = i; } return ans; }