# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
260788 | T0p_ | 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>
using namespace std;
vector<long long> v;
long long findGap(int t, int n)
{
long long s = -1, t = 2e18, mn, mx, ans = 0;
if(t == 1)
{
while(s < t)
{
MinMax(s, t, &mn, &mx);
v.push_back(mn);
v.push_back(mx);
s = mn + 1;
t = mx - 1;
}
sort(v.begin(), v.end());
for(int i=1 ; i<n ; i++)
ans = max(ans, v[i] - v[i-1]);
return ans;
}
else
{
}
}