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>
#define vl vector<ll>
#define ll long long
using namespace std;
long long findGap(int T, int N)
{
vl arr(N);
ll l = 1, r = 1e18;
int le = 0, re = N - 1;
while(le <= re){
ll levo, desno;
MinMax(l, r, &levo, &desno);
arr[le] = levo;
arr[re] = desno;
l = levo + 1;
r = desno - 1;
// cout<<l<<" "<<r<<endl;
le++;
re--;
}
ll ans = 0;
for(int i = 1; i < N; i++)
ans = max(ans, arr[i] - arr[i-1]);
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |