# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
872953 | StefanL2005 | 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"
using namespace std;
#define ll long long
ll findGap(int T, int N)
{
vector<ll> v(N);
int p1 = 0, p2 = N - 1;
ll a = 0, b = pow(10, 18) + 1;
while (p1 <= p2)
{
ll *c1, *c2;
MinMax(a + 1, b - 1, c1, c2);
v[p1] = *c1;
v[p2] = *c2;
p1++; p2--;
a = c1; b = c2;
}
ll maxDif = 0;
for (int i = 1; i < N; i++)
maxDif = max(maxDif, v[i] - v[i - 1]);
return maxDif;
}