# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1015138 | 2024-07-06T06:36:22 Z | vjudge1 | Gap (APIO16_gap) | C++17 | 0 ms | 0 KB |
#include<bits/stdc++.h> // #include "gap.h" using namespace std; typedef long long ll; ll subtask1(int N) { int i = 0, j = N - 1; ll s = 0, e = 1e18; ll *mn = new ll, *mx = new ll; vector<ll> v(N); while(i <= j && s <= e) { MinMax(s, e, mn, mx); v[i] = *mn; v[j] = *mx; i++, j--; s = *mn + 1; e = *mx - 1; } ll ans = 0; for(int i = 1; i < v.size(); i++) ans = max(ans, v[i] - v[i - 1]); // cerr << ans << endl; return ans; } ll findGap(int T, int N) { if(T == 1) return subtask1(N); return 1ll * N; }