# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
140738 | BlueDiamond | 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;
long long findGap(int t, int n) {
if (t == 1) {
vector <long long> vals;
long long st = 0, dr = (long long) 1e18;
while (st <= dr) {
long long a = -1, b = -1;
MinMax(st, dr, a, b);
vals.push_back(a);
if (a < b)
vals.push_back(b);
if (a == -1 || b == -1)
break;
st = a + 1;
dr = b - 1;
}
sort(vals.begin(), vals.end());
long long ans = 0;
for (int i = 0; i + 1 < (int) vals.size(); i++)
ans = max(ans, vals[i + 1] - vals[i]);
return ans;
} else {
}
}