#include "gap.h"
#include <vector>
long long findGap(int T, int N)
{
// if (T == 1) {
std::vector<long long> arr(N);
long long l = 0, r = (long long) 1e18;
long long min_v, max_v;
for (int i = 0; i < (N + 1) / 2; ++i) {
MinMax(l, r, &min_v, &max_v);
// assert(min_v != -1 && max_v != -1);
arr[i] = min_v;
arr[N - i - 1] = max_v;
l = min_v + 1;
r = max_v - 1;
}
long long ans = -1;
for (int i = 0; i < N - 1; ++i) {
ans = std::max(ans, arr[i + 1] - arr[i]);
}
return ans;
// } else if (T == 2) {
// }
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |