# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
661114 | activedeltorre | 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 <iostream>
#include <vector>
#include <algorithm>
vector<long long>vec;
long long findGap(int t, int n)
{
long long a,b,c,d,minim,maxim,diff,i;
MinMax(0,1e18,&minim,&maxim);
diff=(maxim-minim-1)/n+1;
vec.push_back(minim)
vec.push_back(maxim);
for(i=minim;i<maxim;i=i+diff)
{
MinMax(i+1,i+diff,&a,&b);
if(a!=-1)
{
vec.push_back(a);
vec.push_back(b);
}
}
sort(vec.begin(),vec.end());
long long suma=0;
for(i=1;i<vec.size();i++)
{
suma=max(suma,vec[i]-vec[i-1]);
}
return suma;
}