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 s=-1;
long long t=1e18+1;
long long x=-1;
long long y=-1;
long long maxi=LLONG_MIN;
while(s<=t){
MinMax(s+1,t-1,&s,&t);
if(x!=-1){
maxi=max(maxi,s-x);
maxi=max(maxi,y-t);
}
x=s;
y=t;
}
return maxi;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |