#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define endl '\n'
#define pl(var) " [" << #var << ": " << (var) << "] "
#define ll long long
void solve() {
// dp[i][j] = the max sum that can be obtained if j subsegments are chosen and last subsegment ends at i
// dp[i][j] = dp[0..i][j-1]
int n, k; cin >> n >> k;
vector<ll int> arr(n); for (int i = 0; i < n; i++) {
cin >> arr[i];
}
vector<vector<ll int>> dp(n + 1, vector<ll int>(k + 1, 0));
ll int ans = 0;
ll int mn = 0;
ll int pref = 0;
for (int i = 0; i < n; i++) {
pref += arr[i];
mn = min(pref, mn);
dp[i][1] = max(pref - mn, pref);
ans = max(ans, dp[i][1]);
}
for (int i = 2; i <= k; i++) {
for (int j = i - 1; j < n; j++) {
int cur = arr[j];
int best = arr[j];
for (int k = j - 1; k >= 0; k--) {
dp[j][i] = max(dp[k][i - 1] + best, dp[j][i]);
cur += arr[k];
best = max(best, cur);
}
ans = max(ans, dp[j][i]);
}
}
cout << ans << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int T = 1;
// cin >> T;
while (T--)
solve();
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
133 ms |
262144 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
48 ms |
18612 KB |
Output is correct |
2 |
Correct |
48 ms |
18984 KB |
Output is correct |
3 |
Correct |
40 ms |
18616 KB |
Output is correct |
4 |
Runtime error |
136 ms |
262144 KB |
Execution killed with signal 9 |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
47 ms |
18776 KB |
Output is correct |
2 |
Correct |
48 ms |
18616 KB |
Output is correct |
3 |
Correct |
74 ms |
18832 KB |
Output is correct |
4 |
Correct |
52 ms |
18636 KB |
Output is correct |
5 |
Correct |
46 ms |
18764 KB |
Output is correct |
6 |
Correct |
47 ms |
18892 KB |
Output is correct |
7 |
Correct |
47 ms |
19012 KB |
Output is correct |
8 |
Correct |
49 ms |
18756 KB |
Output is correct |
9 |
Correct |
56 ms |
19020 KB |
Output is correct |
10 |
Correct |
56 ms |
18908 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
133 ms |
262144 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |