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"
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;
void setIO() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
ll findGap(int T, int n) {
vector<ll> v(n);
MinMax(-1, 1e18+1, &v[0], &v[n-1]);
int i=1, j=n-2;
ll ans = 0;
while(i <= j) {
MinMax(v[i-1]+1, v[j+1]-1, &v[i], &v[j]);
ans = max(ans, v[i] - v[i-1]);
ans = max(ans, v[j+1] - v[j]);
i++, j--;
}
return ans;
}
// int32_t main() {
// setIO();
// //code starts here
// return 0;
// }
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |