제출 #1083350

#제출 시각아이디문제언어결과실행 시간메모리
1083350djs100201Gap (APIO16_gap)C++17
0 / 100
36 ms1880 KiB
#include "gap.h" #include <bits/stdc++.h> #define all(v) v.begin(), v.end() using namespace std; using ll = long long; using P = pair<ll, ll>; using PP = pair<ll, P>; const ll n_ = 2e5 + 10, inf = (ll)2e9 * (ll)1e9 + 7, mod = 998244353; ll n, m, tc = 1, a, b, c, d, sum, x, y, z, base, ans, k; ll findGap(int T, int N) { vector<ll> res(N); ll l = 0, r = 1e18, mn, mx; ll lidx = 0, ridx = N - 1; while (lidx <= ridx) { if (lidx == ridx) { MinMax(l + 1, (ll)1e18, &mn, &mx); res[lidx] = mn; break; } MinMax(l + 1, r - 1, &mn, &mx); res[lidx++] = mn, res[ridx--] = mx; l = res[lidx - 1], r = res[ridx + 1]; } ll ret = 0; for (int i = 1; i < N; i++) ret = max(ret, res[i] - res[i - 1]); return ret; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...