# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
661123 | activedeltorre | Gap (APIO16_gap) | C++14 | 54 ms | 2252 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 <algorithm>
#include <vector>
using namespace std;
vector<long long>vec;
#include <stdlib.h>
long long findGap(int t, int n)
{
long long a,b,minim,maxim,diff,i;
minim=0;
maxim=1e18;
for(i=1;i<=(n+1)/2;i++)
{
MinMax(minim,maxim,&a,&b);
vec.push_back(a);
vec.push_back(b);
minim=a+1;
maxim=b-1;
}
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;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |