# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
401428 | victoriad | 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 "vector"
using namespace std;
long long findGap(int T, int N)
{ vector<int>a;
while(a.size()<N){
long long int i=0;
long long mn,mx;
MinMax(i,i+1,mn,mx);
if(mn==mx){
a.push_back(mn);
}
else{
a.push_back(mn);
a.push_back(mx);
}
}
int x=0;
for(int i=0;i<N-1;i++){
x=max(x,a[i+1]-a[i]);
}
return x;
}