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;
long long findGap(int T, int N) {
if (T == 1) {
long long lb = 0, rb = (long long) 1e18L;
vector<long long> a(N);
for (int i = 0; i < (N + 1) / 2; i++) {
MinMax(lb, rb, &a[i], &a[N - 1 - i]);
lb = a[i] + 1;
rb = a[N - 1 - i] - 1;
}
long long ans = 0;
for (int i = 1; i < N; i++) {
ans = max(ans, a[i] - a[i - 1]);
}
return ans;
}
long long lb = 0, rb = (long long) 1e18L;
vector<long long> a(N);
for (int i = N - 1; i > 0; i--) {
MinMax(lb, rb, &a[0], &a[i]);
rb = a[i] - 1;
}
long long ans = 0;
for (int i = 1; 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... |