# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1076434 | 2024-08-26T13:51:03 Z | Icelast | Gap (APIO16_gap) | C++17 | 0 ms | 0 KB |
#include "gap.h" #include <iostream> #include <bits/stdc++.h> #define ll long long using namespace std; const ll maxn = 2*1e5+5, INF = 4e18+9; long long findGap(int T, int n) { ll ans = 0; if(T == 1){ ll l = 0, r = INF; ll mn, mx; vector<ll> a(n+1); for(int i = 1; i <= (n+1)/2; i++){ MaxMin(l, r, &mn, &mx); a[i] = mn; a[n-i+1] = mx; l = mn+1, r = mx-1; } for(int i = 2; i <= n; i++){ ans = max(ans, a[i]-a[i-1]); } }else{ return 0; } return ans; }