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;
long long a[100005];
/*pair<long long,long long> MinMax(long long l,long long r)
{
int64_t minn=-1,maxn=-1;
for(int i=1;i<=n;i++)
if(l<=a[i]&&a[i]<=r)
{
minn=a[i];
break;
}
for(int i=n;i>=1;i--)
if(l<=a[i]&&a[i]<=r)
{
maxn=a[i];
break;
}
return make_pair(minn,maxn);
}*/
long long findGap(int T, int n)
{
if(T==1)
{
long long L,R,preL,preR,res=0;
MinMax(0,1e18,&preL,&preR);
//preL=tmp.first;
//preR=tmp.second;
while(1)
{
MinMax(preL+1,preR-1,&L,&R);
//L=tmp.first;
//R=tmp.second;
if(L==-1)
{
res=max(res,preR-preL);
break;
}
res=max(res,max(L-preL,preR-R));
preL=L;
preR=R;
if(L==R)
break;
}
return res;
}
}
/*int main()
{
cin>>n;
for(int i=1;i<=n;i++)
cin>>a[i];
cout<<findGap(1,n);
}*/
Compilation message (stderr)
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:51:1: warning: control reaches end of non-void function [-Wreturn-type]
}
^
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |