# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1232351 | PlayVoltz | K개의 묶음 (IZhO14_blocks) | C++20 | 0 ms | 0 KiB |
#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
#include <random>
#include <chrono>
#include <fstream>
using namespace std;
#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
int32_t main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k;
cin>>n>>k;
vector<int> vect(n+1);
vector<vector<int> > dp(k+1, vector<int>(n+1, LLONG_MAX/2));
dp[1][0]=0;
for (int i=1; i<=n; ++i)cin>>vect[i], dp[1][i]=max(dp[1][i-1], vect[i]);
for (int i=2; i<=k; ++i){
deque<pii> deq;
for (int j=i; j<=n; ++j){
int best=dp[i-1][j-1];
while (deq.size()&&deq.back().fi<=vect[j])best=min(best, deq.back().se), deq.pop_back();
dp[i][j]=best+vect[j];
if (deq.size())dp[i][j]=min(dp[i][j], dp[i][deq.back().fiw]);
deq.pb(mp(vect[j], best));
}
}
cout<<dp[k][n];
}