# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1084169 | Timosh | 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> a, b;
ll l = 0, r = 1e18;
long long mn, mx;
while (1)
{
MinMax(l, r, mn, mx);
if (mx == -1)
break;
a.push_back(mn);
b.push_back(mx);
l = mn + 1, r = mx - 1;
}
reverse(b.begin(), b.end());
ll ans = 0;
int last = a[0];
for (auto &i : a)
{
ans = max(ans, i - last);
last = i;
}
for (auto &i : b)
{
ans = max(ans, i - last);
last = i;
}
return ans;
}
int main()
{
return 0;
}