# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1015109 | vjudge1 | Gap (APIO16_gap) | C++17 | 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;
ll subtask1(int N)
{
int i = 0, j = N - 1;
ll s = 0, e = 1e18;
ll mn, mx;
vector<ll> v(N);
while(i <= j)
{
MinMax(s, e, mn, mx);
v[i] = mn;
v[j] = mx;
i++, j--;
s = mn + 1;
e = mx - 1;
}
ll ans = 0;
for(int i = 1; i < v.size(); i ++)
ans = max(ans, v[i] - v[i - 1]);
return ans;
}
ll findGap(int T, int N)
{
if(T == 1) return subtask1(N);
return N;
}