# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
160200 | 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;
typedef long long ll;
const int N = (int) 1e5 + 7;
ll hidden[N];
ll findGap(int t, int n) {
int i = 1, j = n;
ll s = 1, t = (ll) 1e18;
while (i <= j) {
ll mn, mx;
MinMax(s, t, mn, mx);
hidden[i] = mn;
hidden[j] = mx;
i++;
j--;
}
ll ans = 0;
for (int i = 1; i < n; i++)
ans = max(ans, hidden[i + 1] - hidden[i]);
return ans;
}