Submission #30912

#TimeUsernameProblemLanguageResultExecution timeMemory
30912sean617Gap (APIO16_gap)C++98
30 / 100
66 ms5924 KiB
#include "gap.h" #define SZ 100005 #include <iostream> typedef long long ll; using namespace std; ll a[SZ]; long long findGap(int T, int N) { ll st = 0, en = 1e18, i = 0, j = N - 1, mn, mx, ans; while (i <= j) { MinMax(st, en, &mn, &mx); a[i] = mn; a[j] = mx; st = mn + 1; en = mx - 1; i++; j--; } ans = a[1] - a[0]; for (i = 1; i < N - 1; i++) { ans = max(ans, a[i + 1] - a[i]); } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...