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