Submission #798200

#TimeUsernameProblemLanguageResultExecution timeMemory
798200tch1cherinHacker (BOI15_hac)C++17
40 / 100
1078 ms1848 KiB
#include <bits/stdc++.h> using namespace std; int main() { int N; cin >> N; vector<int> A(2 * N); for (int i = 0; i < N; i++) { cin >> A[i]; A[i + N] = A[i]; } int M = (N + 1) / 2; vector<int> B(2 * N); for (int i = 0; i < 2 * N; i++) { if (i > 0) { B[i] += B[i - 1]; } B[i] += A[i]; if (i >= M) { B[i] -= A[i - M]; } } int ans = 0; for (int i = 0; i + M <= 2 * N; i++) { int min_val = INT_MAX; for (int j = i; j < i + M; j++) { min_val = min(min_val, B[j]); } ans = max(ans, min_val); } cout << ans << "\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...