제출 #977846

#제출 시각아이디문제언어결과실행 시간메모리
977846AmaarsaaGap (APIO16_gap)C++14
30 / 100
28 ms3644 KiB
#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); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...