# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
47273 | Talant | Gap (APIO16_gap) | C++17 | 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"
//#include "grader.cpp"
#define int long long
using namespace std;
const int M = (1e6 + 5);
int ans = 0;
int a[M];
int l,r = 1e18;
int ll,rr;
long long findGap(int T, int N)
{
if (T == 1) {
int o = (N + 1) / 2;
ll = 1,rr = N;
while (o --) {
MinMax(l,r,&a[ll],&a[rr]);
l = a[ll] + 1,r = a[rr] + 1;
ll ++,rr --;
}
for (int i = 1; i < N; i ++)
ans = max(ans,a[i + 1] - a[i]);
return ans;
}
else {
return 0;
}
}