#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
using namespace std;
const int N = 1e5 + 50;
int dp[N][105];
main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
memset(dp, 0x3f3f, sizeof(dp));
int n, k;
cin >> n >> k;
vector <int> v(n + 1);
for(int i = 1; i <= n; i++){
cin >> v[i];
}
dp[1][0] = -1e9;
for(int i = 1; i <= n; i++)dp[1][i] = max(v[i], dp[1][i - 1]);
for(int i = 2; i <= k; i++){
deque <pair <int,int> > d;
for(int j = i; j <= n; j++){
int prev = dp[i - 1][j - 1];
while(!d.empty() && d.front().ff < v[j]){
prev = min(d.front().ss, prev);
d.pop_back();
}
if(d.empty() || prev + v[j] < d.back().ff + d.back().ss){
d.push_back({v[j], prev});
}
dp[i][j] = d.back().ff + d.back().ss;
//if(i == 3)cout <<prev <<" " << v[j] << endl;
}
}
cout << dp[k][n];
}
Compilation message
blocks.cpp:13:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
13 | main(){
| ^~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
16 ms |
41428 KB |
Output is correct |
2 |
Correct |
16 ms |
41388 KB |
Output is correct |
3 |
Correct |
16 ms |
41328 KB |
Output is correct |
4 |
Correct |
17 ms |
41428 KB |
Output is correct |
5 |
Correct |
16 ms |
41492 KB |
Output is correct |
6 |
Correct |
18 ms |
41380 KB |
Output is correct |
7 |
Correct |
16 ms |
41396 KB |
Output is correct |
8 |
Correct |
16 ms |
41420 KB |
Output is correct |
9 |
Correct |
17 ms |
41332 KB |
Output is correct |
10 |
Incorrect |
16 ms |
41428 KB |
Output isn't correct |
11 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
18 ms |
41372 KB |
Output is correct |
2 |
Correct |
15 ms |
41388 KB |
Output is correct |
3 |
Correct |
17 ms |
41400 KB |
Output is correct |
4 |
Correct |
16 ms |
41400 KB |
Output is correct |
5 |
Correct |
15 ms |
41428 KB |
Output is correct |
6 |
Correct |
17 ms |
41388 KB |
Output is correct |
7 |
Correct |
16 ms |
41352 KB |
Output is correct |
8 |
Correct |
16 ms |
41388 KB |
Output is correct |
9 |
Correct |
18 ms |
41344 KB |
Output is correct |
10 |
Incorrect |
16 ms |
41416 KB |
Output isn't correct |
11 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
16 ms |
41428 KB |
Output is correct |
2 |
Correct |
16 ms |
41388 KB |
Output is correct |
3 |
Correct |
16 ms |
41328 KB |
Output is correct |
4 |
Correct |
17 ms |
41428 KB |
Output is correct |
5 |
Correct |
16 ms |
41492 KB |
Output is correct |
6 |
Correct |
18 ms |
41380 KB |
Output is correct |
7 |
Correct |
16 ms |
41396 KB |
Output is correct |
8 |
Correct |
16 ms |
41420 KB |
Output is correct |
9 |
Correct |
17 ms |
41332 KB |
Output is correct |
10 |
Incorrect |
16 ms |
41428 KB |
Output isn't correct |
11 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
16 ms |
41428 KB |
Output is correct |
2 |
Correct |
16 ms |
41388 KB |
Output is correct |
3 |
Correct |
16 ms |
41328 KB |
Output is correct |
4 |
Correct |
17 ms |
41428 KB |
Output is correct |
5 |
Correct |
16 ms |
41492 KB |
Output is correct |
6 |
Correct |
18 ms |
41380 KB |
Output is correct |
7 |
Correct |
16 ms |
41396 KB |
Output is correct |
8 |
Correct |
16 ms |
41420 KB |
Output is correct |
9 |
Correct |
17 ms |
41332 KB |
Output is correct |
10 |
Incorrect |
16 ms |
41428 KB |
Output isn't correct |
11 |
Halted |
0 ms |
0 KB |
- |