# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
560899 | CoderNTT | Gap (APIO16_gap) | C++14 | 0 ms | 0 KiB |
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 task "CROBOT"
#define ll long long
#define ld long double
#define fi first
#define se second
using namespace std;
const int maxn = 1e5 + 1;
const int mod = 1e9 + 7;
ll n, m, k, q, l, r;
ll findGap(int t, int n)
{
if (t == 1)
{
l = -1, r = 2e18 + 1;
for (int i = 1; i = (n + 1) / 2; i++)
{
MinMax(l, r, &a[i], &a[n - i + 1]);
l = a[i] + 1;
r = a[n - i + 1] - 1;
}
ll ans = -1;
for (int i = 2; i <= n; i++)
ans = max(ans, a[i] - a[i - 1]);
return ans;
}
return -1;
}