Submission #795958

#TimeUsernameProblemLanguageResultExecution timeMemory
79595812345678Feast (NOI19_feast)C++17
21 / 100
1083 ms32088 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long const int nx=3e3+5; ll n, k, dp[nx][nx], v[nx], qs[nx]; int main() { cin.tie(NULL)->sync_with_stdio(false); cin>>n>>k; for (int i=1; i<=n; i++) cin>>v[i], qs[i]=qs[i-1]+v[i]; for (int i=1; i<=n; i++) { for (int j=0; j<=k; j++) { dp[i][j]=dp[i-1][j]; if (j>0) for (int l=0; l<i; l++) dp[i][j]=max(dp[l][j-1]+qs[i]-qs[l], dp[i][j]); //cout<<i<<' '<<j<<' '<<dp[i][j]<<'\n'; } } cout<<dp[n][k]; }
#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...