# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1232327 | marselel | Gap (APIO16_gap) | C++20 | 0 ms | 0 KiB |
using ll = long long;
int findGap() {
set<int> st;
ll s = -1, t = 2e18;
ll mn = 0, mx = 0;
while (mn <= mx) {
MinMax(s, t, mn, mx);
if (mn == -1 && mx == -1) {
break;
}
st.insert(mn);
st.insert(mx);
s = mn + 1;
t = mx - 1;
}
vector<int> a;
for (auto v : st) {
a.push_back(v);
}
ll ans = 0;
for (int i = 1; i < (int)a.size(); ++i) {
ans = max(ans, a[i] - a[i - 1]);
}
return ans;
}