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 <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
long long a[N];
long long findGap(int T, int n) {
assert(T == 1);
long long s = 0, t = 1e18;
long long mn, mx;
for (int i = 1; i <= (n + 1) / 2; ++i) {
if (s <= t) MinMax(s, t, &mn, &mx);
a[i] = mn; a[n - i + 1] = mx;
s = mn + 1, t = mx - 1;
}
long long ans = 0;
for (int i = 2; i <= n; ++i) ans = max(ans, a[i] - a[i - 1]);
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |