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"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[100010], mx;
int n;
long long findGap(int T, int N)
{
n = N;
if(T == 1)
{
MinMax(0,1e18,a,a + n-1);
for(int i = 1; i < n/2; i++)
MinMax(a[0]+1,a[n-1]-1,a + i,a + n-1-i);
}
for(int i = 0; i < n-1; i++)
mx = max(mx,a[i+1]-a[i]);
return mx;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |