Submission #337579

#	Time	Username	Problem	Language	Result	Execution time	Memory
337579		BY_KUTBILIM	K blocks (IZhO14_blocks)	C++14	100 / 100	323 ms	40772 KiB

blocks

/** @BY_KUTBILIM **/
#include <bits/stdc++.h>
using namespace std;

#define ff first
#define ss second
#define pb push_back  
#define ll long long

const int inf = (int)1e9+7;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie();

    int n, k;
    cin >> n >> k;
    int a[n+1];
    int dp[n+1][k+1];
    
    for(int i = 1; i <= n; i++)cin >> a[i];
    
    for(int i = 0; i <= n; i++){
        for(int j = 0; j <= k; j++){
            dp[i][j] = inf;
        }
    }
    dp[0][0] = 0;
    dp[1][1] = a[1];
    for(int i = 2; i <= n; i++){
        dp[i][1] = max(dp[i-1][1], a[i]);
    }
    
    for(int block = 2; block <= k; block++){
        stack<pair<int,int>> st;
        
        for(int i = 1; i <= n; i++){
            int mn = dp[i-1][block-1];
            while(!st.empty() and a[st.top().first] <= a[i]){
                mn = min(mn, st.top().second);
                st.pop();
            }
            if(!st.empty()){
                dp[i][block] = min(dp[i][block], dp[st.top().first][block]);
            }
            dp[i][block] = min(dp[i][block], mn + a[i]);
            st.push({i, mn});
        }
    }
    cout << dp[n][k];
    return 0;
}

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