# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
142708 | HellAngel | 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>
#define int long long
using namespace std;
#include "gap.h"
long long findGap(int T, int N)
{
int ans = 0;
if(T == 1)
{
int mx, my;
vector<int> vt = {};
int l = 0;
int r = LLONG_MAX;
while(true)
{
MinMax(l, r, &mx, &my);
if(mx == my)
{
vt.push_back(mx);
break;
}
if(mx == -1)
{
break;
}
vt.push_back(mx);
vt.push_back(my);
l = mx + 1;
r = my - 1;
}
sort(vt.begin(), vt.end());
for(int i = 1; i < vt.size(); i++)
{
ans = max(ans, vt[i] - vt[i - 1]);
}
}
return ans;
}