제출 #340868

#제출 시각아이디문제언어결과실행 시간메모리
340868super_j6Gap (APIO16_gap)C++14
70 / 100
57 ms1424 KiB
#include "gap.h" #include <iostream> #include <cstdio> #include <algorithm> using namespace std; #define endl '\n' #define ll long long #define pi pair<int, int> #define f first #define s second /* const int mxn = 100000; int t, n; ll a[mxn]; void MinMax(ll l, ll r, ll *x, ll *y){ l = lower_bound(a, a + n, l) - a; r = upper_bound(a, a + n, r) - a - 1; if(l > r) *x = -1, *y = -1; else *x = a[l], *y = a[r]; } */ void f(ll l, ll r, ll &x, ll &y){ MinMax(l, r, &x, &y); } ll findGap(int t, int n){ ll l, r, ret = 0; f(0, 1e18, l, r); if(n == 2) return r - l; for(ll i = l + 1, d = 2 * (r - l - 1) / (n - 2); i < r; i += d){ ll x, y; f(i, min(r - 1, i + d - 1), x, y); if(~x && ~y) ret = max({ret, x - l, y - x}), l = y; } ret = max(ret, r - l); return ret; } /* int main(){ ios::sync_with_stdio(0); cin.tie(0); cin >> t >> n; for(int i = 0; i < n; i++) cin >> a[i]; cout << findGap(t, n) << endl; return 0; } */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...