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"
#define f MinMax
#define max(x,y) ((x)>(y)?(x):(y))
long long findGap(int T, int N)
{
long long s,e,ps,pe,maxx=0;
if(T==1){
f(0,(1LL<<62),&ps,&pe);
N-=2;
while(N){
f(ps+1,pe-1,&s,&e);
N-=2;
maxx=max(maxx,max(s-ps,pe-e));
ps=s;pe=e;
}
return max(maxx,pe-ps);
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |