| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1344824 | ramzialoulou | Gap (APIO16_gap) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
long long findGap(int T, int N) {
vector<long long> a(N);
long long l = -1, r = (long long) 1e18 + 1;
for (int i = 0; i < N / 2; i++) {
long long mn = l, mx = r;
assert(l + 1 <= r - 1);
MinMax(l + 1, r - 1, &l, &r);
a[i] = l;
a[N - 1 - i] = r;
}
if (n & 1) {
if (l < r) {
MinMax(l + 1, r - 1, &l, &r);
}
a[N / 2] = l;
}
long long ans = 0;
for (int i = 1; i < N; i++) {
ans = max(ans, a[i] - a[i - 1]);
}
return ans;
}
