제출 #849811

#제출 시각아이디문제언어결과실행 시간메모리
849811nninGap (APIO16_gap)C++14
0 / 100
18 ms3028 KiB
#include "gap.h" #define ll long long #include<bits/stdc++.h> using namespace std; long long findGap(int T, int N) { ll mn, mx, curmn, curmx; MinMax((ll)1, (ll)1e18, &mn, &mx); ll ans = 0; while(N>2) { MinMax(mn+ans+1, mx-ans-1, &curmn, &curmx); ans = max(ans, max(curmn-mn, mx-curmx)); N -= 2; mx = curmx; mn = curmn; } ans = max(ans, mx-mn); return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...