Submission #723157

#	Time	Username	Problem	Language	Result	Execution time	Memory
723157		buihuynhtay	K blocks (IZhO14_blocks)	C++14	100 / 100	159 ms	40644 KiB

blocks

#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 55;
const int inf = 1e9 + 7;
int n, k, a[N];
int dp[101][N];

void solve(){
    cin >> n >> k;
    for(int i = 1 ;i <= n; i++) cin >> a[i];
    int mx = 0;
    for(int g = 0; g <= k; g++)
        for(int i = 0; i <= n; i++)
            dp[g][i] = inf;
    for(int i = 1; i <= n; i++){
        mx = max(mx, a[i]);
        dp[1][i] = mx;
    }
    for(int g = 2; g <= k; g++){
        stack<pair<int, int>> st;
        for(int i = 1; i <= n; i++){
            int mi = dp[g-1][i-1];
            while(!st.empty() && a[st.top().second] <= a[i]){
                mi = min(mi, st.top().first);
                st.pop();
            }
            dp[g][i] = min(dp[g][st.empty() ? 0 : st.top().second], mi + a[i]);
            st.push(make_pair(mi, i));
        }
    }
    cout << dp[k][n] << '\n';
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    solve();
    return 0;
}

• Subtask 1: 14 / 14
• Subtask 2: 18 / 18
• Subtask 3: 21 / 21
• Subtask 4: 47 / 47