#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mxN = 301;
int dp[mxN][mxN], a[mxN];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(nullptr); cout.tie(nullptr);
int n, k;
cin >> n >> k;
for(int i = 1; i <= n; ++i){
cin >> a[i];
a[i] = a[i - 1] + a[i];
}
for(int j = 1; j <= k; ++j){
pair<int, int> mn = {0, 0};
for(int i = 1; i <= n; ++i){
mn = min(mn, {a[i], i});
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
dp[i][j] = max(dp[i][j], a[i] - mn.first + dp[mn.second][j - 1]);
}
}
cout << dp[n][k] << "\n";
return 0;
}
| # | 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... |