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 <bits/stdc++.h>
#include "gap.h"
#define pb push_back
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
long long findGap(int T, int N) {
ll arr[N + 5];
int l = 1, r = N;
arr[0] = 0, arr[N + 1] = (ll)1e18;
while (l <= r) {
MinMax(arr[l - 1] + 1, arr[r + 1] - 1, arr + l, arr + r);
++l, --r;
}
ll ret = 0;
for (int i = 2; i <= N; ++i) {
ret = max(ret, arr[i] - arr[i - 1]);
}
return ret;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |