# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
977837 | 2024-05-08T11:45:01 Z | Amaarsaa | Gap (APIO16_gap) | C++14 | 0 ms | 0 KB |
#include<bits/stdc++.h> #include "gap.h" using namespace std; using ll =long long; ll Sub1(ll N) { ll b[n + 2],ans, lo1, hi1, lo, hi, l, r; l = 1; r = n; lo = 0; hi = 1e18; while ( l < r) { MinMax(lo, hi, &lo1, &hi1); if (lo1 == -1) break; b[l] = lo1; b[r] = hi1; lo = lo1 + 1; hi = hi1 - 1; l ++; r --; } ans = 0; for (int i = 2; i <= n; i ++) { ans =max(ans, b[i] - b[i - 1]); } return ans; } ll Sub2(ll N) { return N; } long long findGap(int T, int N) { if ( T == 1) { return Sub1(N); } else return Sub2(N); }