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;
long long findGap(int T, int N)
{
long long arr[N];
long long x1,x2;
long long low = 0,high = 1e18;
for (int i = 0; i < (N+1)/2; i++){
MinMax(low,high,&x1,&x2);
arr[i] = x1,arr[N-i-1] = x2;
low = x1+1,high = x2-1;
}
long long ans = 0;
for (int i = 0; i < N-1; i++) ans = max(ans,arr[i+1]-arr[i]);
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |