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 <bits/stdc++.h>
using namespace std;
long long findGap(int T, int N)
{
long long a[N],lo=0,hi=1000000000000000000;
if (T==1){
for (int i=0;i<=N-i-1;i++){
MinMax(lo,hi,&a[i],&a[N-i-1]);
lo=a[i]+1;
hi=a[N-i-1]-1;
}
long long res=0;
for (int i=0;i<N-1;i++)
res=max(res,a[i+1]-a[i]);
return res;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |