Submission #917376

#TimeUsernameProblemLanguageResultExecution timeMemory
917376theghostkingHacker (BOI15_hac)C++17
0 / 100
1 ms348 KiB
#include <bits/stdc++.h> using namespace std; #define int long long signed main() { int n; cin >> n; vector<int> a(3*n); for (int i = 0; i<n; i++){ cin >> a[i]; a[n+i] = a[i]; a[n+n+i] = a[i]; } int N = 3*n; vector<int> pref(N+1); for (int i = 1; i<=N; i++){ pref[i] = pref[i-1] + a[i-1]; } int tgt = (n+1)/2; int ans = 0; for (int i = n; i<2*n; i++){ int one = pref[i+tgt-1]-pref[i-1]; int two = pref[i]-pref[i-tgt]; ans = max(ans, min(one,two)); } cout << ans; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...