Submission #95629

#TimeUsernameProblemLanguageResultExecution timeMemory
95629shenxyGap (APIO16_gap)C++11
30 / 100
50 ms1272 KiB
#include "gap.h" #include <algorithm> using namespace std; long long findGap(int T, int N){ long long int m, n; MinMax(1, 1000000000000000000LL, &m, &n); long long int ans = 0; long long int a, b; for (int i = 0; i < (N - 1) / 2; i++) { a = m, b = n; MinMax(a + 1, b - 1, &m, &n); ans = max(ans, max(m - a, b - n)); } ans = max(ans, n - m); return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...