#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
struct node{
int s, e, m, val, lz;
node *l, *r;
node(int _s, int _e){
s = _s, e = _e, m = (s + e) >> 1;
if(s != e)l = new node(s, m), r = new node(m+1, e);
val = lz = 0;
}
void prop(){
if(lz){
val += lz;
if(s != e)l->lz += lz, r->lz += lz;
lz = 0;
}
}
void upd(int a, int b, int c){
if(a == s && b == e)lz += c;
else{
if(b <= m)l->upd(a, b, c);
else if(a > m)r->upd(a, b, c);
else l->upd(a, m, c), r->upd(m+1, b, c);
l->prop(), r->prop();
val = min(l->val, r->val);
}
}
int qry(int a, int b){
prop();
if(a == s && b== e)return val;
else if(b <= m)return l->qry(a, b);
else if(a > m)return r->qry(a ,b);
else return min(l->qry(a, m), r->qry(m+1, b));
}
void clr(){
val = lz = 0;
if(s != e)l->clr(), r->clr();
}
}*root;
int A[100005], dp[105][100005], mn[105][100005];
void solve(){
int n, k; cin >> n >> k;
for(int i=1;i<=n;i++)cin >> A[i];
root = new node(1, n);
for(int i=1;i<=k;i++)dp[i][0] = 1e18;
for(int i=1;i<=n;i++)dp[0][i] = 1e18;
for(int i=1;i<=k;i++){
stack <int> s;
//root->clr();
for(int j=1;j<=n;j++){
int prv = j - 1;
dp[i][j] = dp[i-1][j-1] + A[j];
//root->upd(j, j, dp[i - 1][j - 1] + A[j]);
while(!s.empty() && A[s.top()] < A[j]){
/*
int x = s.top(); s.pop();
prv = x;
int nxt = (s.empty() ? 0 : s.top());
dp[i][j] = min(dp[i][j], (x >= i - 1 ? mn[i-1][nxt] + A[j] : (int)1e18));
//cout << nxt + 1 << ' ' << x << ' ' << A[j] - A[x] << '\n';
//root->upd(nxt + 1, x, A[j] - A[x]);
*/
s.pop();
}
if(!s.empty())dp[i][j] = min(dp[i][j], dp[i][s.top()]);
int nxt = (s.empty() ? 0 : s.top());
if(i <= j)dp[i][j] = min(dp[i][j], mn[i-1][nxt] + A[j]);
//dp[i][j] = root->qry(1, j);
//cout << dp[i][j] << ' ';
s.push(j);
}
mn[i][n] = dp[i][n];
for(int j=n-1;j>=0;j--)mn[i][j] = min(dp[i][j], mn[i][j+1]);
//cout << '\n';
}
cout << dp[k][n];
}
main(){
ios::sync_with_stdio(0);cin.tie(0);
int tc = 1;
//cin >> tc;
for(int tc1=1;tc1<=tc;tc1++){
// cout << "Case #" << tc1 << ": ";
solve();
}
}
Compilation message
blocks.cpp: In function 'void solve()':
blocks.cpp:67:8: warning: unused variable 'prv' [-Wunused-variable]
67 | int prv = j - 1;
| ^~~
blocks.cpp: At global scope:
blocks.cpp:96:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
96 | main(){
| ^~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
6492 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
6492 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
6488 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
6488 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
6492 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
6492 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
6492 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
6492 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
