Submission #1076389

#TimeUsernameProblemLanguageResultExecution timeMemory
1076389PanndaGap (APIO16_gap)C++17
30 / 100
29 ms3508 KiB
#include "gap.h" #include <bits/stdc++.h> using namespace std; long long findGap(int type, int n) { constexpr long long C = 1e18; if (type == 1) { vector<long long> a(n); int idx_l = 0, idx_r = n - 1; long long l = 0, r = C; for (int t = 0; t < (n + 1) / 2; t++) { MinMax(l, r, &a[idx_l], &a[idx_r]); l = a[idx_l] + 1; r = a[idx_r] - 1; idx_l++; idx_r--; } long long ans = 0; for (int i = 0; i + 1 < n; i++) { ans = max(ans, a[i + 1] - a[i]); } return ans; } else { return 0; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...