#include <bits/stdc++.h>
#define fr first
#define sc second
#define OK puts("OK");
#define pb push_back
#define mk make_pair
using namespace std;
typedef long long ll;
const int inf = (int)1e9 + 7;
const int N = (int)1e6 + 7;
int n,k;
int a[N];
int dp[102][N];
int get (int l,int r) {
int mx = 0;
for (int i = l; i <= r; i ++)
mx = max(mx,a[i]);
return mx;
}
int main () {
cin >> n >> k;
for (int i = 1; i <= n; i ++) {
cin >> a[i];
}
memset(dp,0x3f3f3f3f,sizeof(dp));
dp[1][1] = a[1];
dp[0][0] = 0;
for (int i = 1; i <= k; i ++) {
for (int j = 1; j <= n; j ++) {
for (int l = i - 1; l < j; l ++) {
dp[i][j] = min(dp[i][j],dp[i - 1][l] + get(l + 1,j));
}
}
}
cout << dp[k][n] << endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
0 ms |
1840 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
0 ms |
1840 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
0 ms |
1840 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
0 ms |
1840 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |