#include <bits/stdc++.h>
using namespace std;
const int N = 3005, oo = 1e9;
int n, k, a[N], dp[N][N];
int main() {
cin >> n >> k;
for(int i = 1; i <= n; ++i) {
cin >> a[i];
}
for(int i = 0; i < N; ++i) {
for(int j = 0; j < N; ++j) {
dp[i][j] = oo;
}
}
stack < int > st;
dp[0][0] = 0;
for(int i = 1; i <= n; ++i) {
while(!st.empty() && a[st.top()] <= a[i]) st.pop();
int x = 0;
if(!st.empty()) x = st.top();
for(int j = 1; j <= min(i, k); ++j) {
dp[i][j] = min(dp[x][j], dp[x][j - 1] + a[i]);
}
st.push(i);
}
cout << dp[n][k] << '\n';
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
23 ms |
35704 KB |
Output is correct |
2 |
Correct |
22 ms |
35712 KB |
Output is correct |
3 |
Correct |
22 ms |
35704 KB |
Output is correct |
4 |
Incorrect |
22 ms |
35712 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
25 ms |
35712 KB |
Output is correct |
2 |
Correct |
22 ms |
35712 KB |
Output is correct |
3 |
Correct |
24 ms |
35712 KB |
Output is correct |
4 |
Incorrect |
23 ms |
35704 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
23 ms |
35704 KB |
Output is correct |
2 |
Correct |
22 ms |
35712 KB |
Output is correct |
3 |
Correct |
22 ms |
35704 KB |
Output is correct |
4 |
Incorrect |
22 ms |
35712 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
23 ms |
35704 KB |
Output is correct |
2 |
Correct |
22 ms |
35712 KB |
Output is correct |
3 |
Correct |
22 ms |
35704 KB |
Output is correct |
4 |
Incorrect |
22 ms |
35712 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |