# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
401431 | victoriad | Gap (APIO16_gap) | C++14 | 3101 ms | 1984 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"
#include <cmath>
using namespace std;
long long findGap(int T, int N)
{ vector<long long>a;
long long i=0;
while(a.size()<N){
long long int s=i,t=i+1;
MinMax(i,i+1,&s,&t);
i+=2;
if(s==t){
if(s<0)continue;
a.push_back(t);
}
else{
a.push_back(s);
a.push_back(t);
}
long long int x=0;
for(int k=0;k<N-1;k++){
if(x<(a[k+1]-a[k]))x=a[k+1]-a[k];
}
return x;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |