# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1144318 | THXuan | Gap (APIO16_gap) | C11 | 0 ms | 0 KiB |
#include "gap.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
long long findGap(int T, int N)
{
if (T == 1) {
ll l = 0, r = 1e18;
vector<ll>a;
while (a.size() < N) {
ll mn, mx;
MinMax(l, r, &mn, &mx);
a.push_back(mn);
if (mn == mx)break;
a.push_back(mx);
l = mn + 1;
r = mx - 1;
if (a.size() == N)break;
}
ll ans = 0;
sort(a.begin(), a.end());
for (int i = 0; i + 1 < N; i++)ans = max(ans, a[i + 1] - a[i]);
return ans;
}
}