#include <bits/stdc++.h>
using namespace std;
#define ll long long
int n,k;
const ll inf=1e18;
const int N=2010;
int a[N];
ll dp[N][N],pre[N];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>n>>k;
for(int i=1;i<=n;i++)cin>>a[i],pre[i]=a[i]+pre[i-1];
for(int j=1;j<=k;j++)
{
ll bst=0;
for(int i=1;i<=n;i++)
{
bst=max(bst,dp[i][j-1]-pre[i]);
dp[i][j]=max(dp[i-1][j],bst+pre[i]);
}
}
cout<<dp[n][k]<<endl;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |