Submission #311842

#	Time	Username	Problem	Language	Result	Execution time	Memory
311842		nikatamliani	K blocks (IZhO14_blocks)	C++14	0 / 100	25 ms	35712 KiB

blocks

#include <bits/stdc++.h>
using namespace std;
const int N = 3005, oo = 1e9;
int n, k, a[N], dp[N][N];
int main() {
    cin >> n >> k;
    for(int i = 1; i <= n; ++i) {
        cin >> a[i];
    }
    for(int i = 0; i < N; ++i) {
        for(int j = 0; j < N; ++j) {
            dp[i][j] = oo;
        }
    }
    stack < int > st;
    dp[0][0] = 0;
    for(int i = 1; i <= n; ++i) {
        while(!st.empty() && a[st.top()] <= a[i]) st.pop();
        int x = 0;
        if(!st.empty()) x = st.top();
        for(int j = 1; j <= min(i, k); ++j) {
            dp[i][j] = min(dp[x][j], dp[x][j - 1] + a[i]);
        }
        st.push(i);
    }
    cout << dp[n][k] << '\n';
}

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