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 <iostream>
using namespace std;
typedef long long int ll;
ll x,y;
vector<ll> V;
long long findGap(int T, int N)
{
for(int i=0;i<N;i++){
MinMax(x,1e18,&x,&y);
V.push_back(x);
x++;
}
x=0;
for(int i=0;i<N-1;i++)
x=max(x,V[i+1]-V[i]);
return x;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |