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;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 1e5;
int T, N;
ll A[MAXN+10], ans;
ll findGap(int _T, int _N)
{
int i, j;
T=_T; N=_N;
ll s=0, t=1e18;
for(i=1, j=N; i<=j; i++, j--)
{
ll a, b;
MinMax(s, t, &a, &b);
A[i]=a; A[j]=b;
s=a+1; t=b-1;
}
for(i=2; i<=N; i++) ans=max(ans, A[i]-A[i-1]);
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |