| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 344021 | milleniumEeee | 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 "gap.h"
#include "grader.cpp"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
//MinMax(long long s, long long t, long long *mn, long long *mx)
const int INF = (int)1e18;
const int MAXN = (int)1e5 + 5;
ll a[MAXN];
long long findGap(int type, int n)
{
ll mn, mx;
MinMax(0, INF, &mn, &mx);
int l = 1, r = n;
a[l] = mn;
a[r] = mx;
l++, r--;
while (l <= r) {
if (l != r) {
MinMax(mn + 1, mx - 1, &mn, &mx);
a[l] = mn;
a[r] = mx;
} else {
MinMax(mn + 1, mx - 1, &mn, &mx);
a[l] = mn;
}
l++, r--;
}
ll ans = 0;
for (int i = 1; i < n; i++) {
ans = max(ans, a[i + 1] - a[i]);
}
return ans;
}