# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
43533 | faustaadp | 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 "gap.h"
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
ll i,has;
vector<ll> v;
void tanya(ll aa,ll bb)
{
if(aa==bb)
v.pb(mi);
if(aa>bb)
return ;
ll mi,ma;
MinMax(aa,bb,&mi,&ma);
if(mi!=ma)
{
ll ce=(aa+bb)/2;
tanya(mi,max(ce,mi));
tanya(min(ce+1,ma),max);
}
else
v.pb(mi);
}
long long findGap(int T, int N)
{
ll L,R;
MinMax(0,1e18,&L,&R);
tanya(L,R);
for(i=1;i<v.size();i++)
has=max(has,v[i]-v[i-1]);
return has;
}