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 <bits/stdc++.h>
#include "gap.h"
using namespace std;
typedef long long ll;
ll v[223456];
long long findGap(int T, int n)
{
int l=0; int r=n-1;
MinMax(0ll,(1ll<<60),&v[0],&v[n-1]);
for (int i=0;i<n/2;i++) {
if (l+1==r) break;
// cout<<l << ' ' << r<<endl;
// cout<<v[l]<< ' '<< v[r]<<endl;
MinMax(v[l]+1,v[r]-1,&v[l+1],&v[r-1]);
l++;
r--;
}
ll ans=0;
for (int i=1;i<n;i++) {
ans=max(ans,v[i]-v[i-1]);
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |