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 <iostream>
#include "gap.h"
using namespace std;
long long all[100005];
long long findGap(int T,int N)
{
long long a,b,l=0,r=N-1,x=0,y=1e18,ans=0;
int i;
while(l<=r)
{
//printf("%lld %lld\n",l,r);
MinMax(x,y,&a,&b);
all[l]=a;
all[r]=b;
//printf("%lld %lld\n",a,b);
x=a+1;
y=b-1;
l++;
r--;
}
for(i=1;i<N;i++) ans=max(ans,all[i]-all[i-1]);
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |