Submission #619628

#TimeUsernameProblemLanguageResultExecution timeMemory
619628ValenzFeast (NOI19_feast)C++14
21 / 100
1086 ms262144 KiB
#include <bits/stdc++.h> using namespace std; #define int long long signed main() { int n,k; cin >> n >> k; vector<int> a(n+1); a[0]=0; for(int i=1;i<=n;i++) { cin >> a[i]; a[i]+=a[i-1]; } vector<vector<int>> dp(n+1,vector<int>(k+1,0)); for(int i=1;i<=n;i++) { for(int j=1;j<=k;j++) { dp[i][j]=max(dp[i][j],dp[i-1][j]); if(j>0) { for(int l=0;l<i;l++) { dp[i][j]=max(dp[i][j],dp[l][j-1]+(a[i]-a[l])); } } } } cout << dp[n][k] << '\n'; 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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...