제출 #1265981

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1265981		rayan_bd	K blocks (IZhO14_blocks)	C++20	0 / 100	0 ms	328 KiB

blocks

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1e18;
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr); cout.tie(nullptr);

    int N, K;
    cin >> N >> K;
    vector<int> a(N + 1, 0);

    vector<vector<int>> dp(N + 1, vector<int> (N + 1, INF));
    for(int i = 1; i <= N; ++i) cin >> a[i];

    for(int i = 0; i <= N; ++i) dp[i][0] = 0;

    // 6 1 2 3 4 5, K = 3

    for(int k = 1; k <= K; ++k){
        stack<int> st;
        vector<int> mn(N + 1, INF);
        int mn_slope = INF;
        for(int i = 1; i <= N; ++i){
            while(st.size() && a[st.top()] <= a[i]){
                dp[i][k] = min(dp[i][k], dp[st.top() - 1][k - 1] + a[i]);
                mn[i] = min(dp[st.top()][k - 1], mn[st.top()]);
                mn_slope = min(mn_slope, mn[i]);
                st.pop();
            }
            dp[i][k] = min(dp[i][k], mn_slope + a[i]);
            if(st.size()){
                dp[i][k] = min(dp[i][k], dp[st.top()][k]);
                dp[i][k] = min(dp[i][k], mn[st.top()] + a[i]);
            }else{
                dp[i][k] = min(dp[i][k], dp[i - 1][k - 1] + a[i]);
            }
            mn_slope = INF;
            st.push(i);
        }
    }

    cout << dp[N][K] << "\n";

    return 0;
}

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