#include <iostream>
#include <map>
#include <vector>
#include <stack>
using namespace std;
const int inf = 2e9;
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
int N, K;
cin >> N >> K;
int dp[1+N][1+K];
int a[1+N];
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
for (int i = 0; i <= N; i++) {
for (int j = 0; j <= K; j++) {
dp[i][j] = inf;
}
}
dp[0][0] = 0;
dp[1][1] = a[1];
for (int i = 2; i <= N; i++) {
dp[i][1] = max(dp[i - 1][1], a[i]);
}
for (int k = 2; k <= K; k++) {
stack < pair < int, int > > st;
for (int i = 1; i <= N; i++) {
int cur = dp[i - 1][k - 1];
dp[i][k] = min(dp[i][k], cur + a[i]);
while (!st.empty() && a[st.top().first] <= a[i]) {
cur = min(cur,st.top().second);
st.pop();
}
if (!st.empty())
dp[i][k] = dp[st.top().first][k];
st.push({i, cur});
}
}
cout << dp[N][K] << '\n';
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
0 ms |
364 KB |
Output is correct |
3 |
Correct |
0 ms |
364 KB |
Output is correct |
4 |
Correct |
0 ms |
364 KB |
Output is correct |
5 |
Incorrect |
0 ms |
364 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
384 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
0 ms |
364 KB |
Output is correct |
5 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
0 ms |
364 KB |
Output is correct |
3 |
Correct |
0 ms |
364 KB |
Output is correct |
4 |
Correct |
0 ms |
364 KB |
Output is correct |
5 |
Incorrect |
0 ms |
364 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
0 ms |
364 KB |
Output is correct |
3 |
Correct |
0 ms |
364 KB |
Output is correct |
4 |
Correct |
0 ms |
364 KB |
Output is correct |
5 |
Incorrect |
0 ms |
364 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |