# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1083344 | dong_gas | Gap (APIO16_gap) | C++17 | 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 <bits/stdc++.h>
#include "gap.h"
using namespace std;
using ll = long long;
ll a[100201];
ll findGap(ll T, ll n) {
ll l = 1, r = n, mn, mx;
ll low = 0, high = 1e18;
while (l < r) {
MinMax(low, high, &mn, &mx);
a[l++] = mn, a[r--] = mx;
low = mn + 1, high = mx - 1;
}
if (l == r) {
Minmax(low, high, &mn, &mx);
a[l] = mn;
}
ll ret = 0;
for (int i = 2; i <= n; i++) ret = max(ret, a[i] - a[i - 1]);
return ret;
}