Submission #761574

#TimeUsernameProblemLanguageResultExecution timeMemory
761574gggkik도넛 (JOI14_ho_t3)C++14
20 / 100
2045 ms400 KiB
#include <bits/stdc++.h> using namespace std; const int MXN = 1e5+5; #define ll long long ll A[MXN], P[MXN], n; ll sum(int i,int j){return (i<=j?P[j]-P[i-1]:0);} int main() { cin.tie(0)->sync_with_stdio(0); cin >> n; ll ans = 0; for(int i = 1;i<=n;i++){ cin >> A[i]; P[i] = P[i-1]+A[i]; } for(int i = 1;i<=n;i++){ for(int j = i;j<=n;j++){ // [i,j] [j+1,k] [k+1,n]+[1,i-1] for(int k = j+1;k<=n;k++){ ans = max(ans,min({sum(i,j),sum(j+1,k),sum(k+1,n)+sum(1,i-1)})); } } } cout << ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...