Submission #723540

#TimeUsernameProblemLanguageResultExecution timeMemory
723540drdilyorHacker (BOI15_hac)C++17
40 / 100
1068 ms1852 KiB
#include<bits/stdc++.h> using namespace std; using ll = long long; int main() { cin.tie(0)->sync_with_stdio(0); int n; cin >> n; vector<int> arr(n*2); for (int i = 0; i < n; i++) { cin >> arr[i]; arr[i+n] = arr[i]; } vector<ll> s(n, 1e18); for (int l = 0, r = (n+1) / 2 - 1; l < n; l++, r++) { ll sum = accumulate(arr.begin() + l, arr.begin() + r + 1, 0ll); for (int i = l; i <= r; i++) s[i%n] = min(s[i%n], sum); } cout << *max_element(s.begin(), s.end()) << '\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...