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 N 100005
using namespace std;
typedef long long ll;
ll n, v[N], ans[N];
ll findGap(int T, int N_)
{
n = N_;
ll esq = 0, dir = 2000000000000000000LL, best = 0;
for(int i = 1, st = 1, en = n; i <= (n + 1)/2; i++, st ++, en --)
{
ll a, b;
MinMax(esq, dir, &a, &b);
esq = a + 1, dir = b - 1;
ans[st] = a, ans[en] = b;
}
for(int i = 2; i <= n; i++) best = max(best, ans[i] - ans[i - 1]);
return best;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |