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];
long long findGap(int T, int n)
{
if(T==1)
{
MinMax(0,1e18,&a[1],&a[n]);
int i=2,j=n-1;
while(i<=j)
{
MinMax(a[i-1]+1,a[j+1]-1,&a[i],&a[j]);
i--;
j++;
}
long long res=0;
for(int i=2; i<=n; i++)
res=max(res,a[i]-a[i-1]);
return res;
}
/*else
{
for(int i=1;i<=n;i++)
a[i]=-1;
MinMax(0,1e18,&a[1],&a[n]);
int i=2,j=n-1,Count=0;
while(i<=j)
{
Count++;
if(Count>100)
break;
MinMax(a[i-1]+1,a[j+1]-1,&a[i],&a[j]);
i--;
j++;
}
long long res=0;
for(int i=2; i<=n; i++)
if(a[i]!=-1&&a[i-1]!=-1)
res=max(res,a[i]-a[i-1]);
return res;
}*/
}
Compilation message (stderr)
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:45: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... |