Submission #817684

#	Time	Username	Problem	Language	Result	Execution time	Memory
817684		vjudge1	K blocks (IZhO14_blocks)	C++17	0 / 100	1 ms	212 KiB

blocks

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

int32_t main() {
        ios_base::sync_with_stdio(0);
        cin.tie(0);
        int n, k;
        cin >> n >> k;
        vector<int> a(n + 1);
        for (int i = 1; i <= n; i++) cin >> a[i];
        vector<int64_t> f(n + 1, 0);
        for (int i = 1; i <= n; i++) f[i] = max<int64_t>(f[i - 1], a[i]);
        vector<int64_t> g(n + 1);
        f[0] = 0;
        for (int i = 1; i < k; i++) {
                vector<int64_t> nf(n + 1, 1e18);
                stack<int> st;
                for (int j = 1; j <= n; j++) {
                        int64_t mn = 1e18;
                        while (st.size() && a[st.top()] < a[j]) {
                                mn = min(mn, g[st.top()]);
                                st.pop();
                        }
                        if (st.size()) nf[j] = min(f[st.top()], nf[st.top()] + a[j]);
                        nf[j] = min(nf[j], mn + a[j]);
                        g[j] = min(f[j], mn);
                        st.emplace(j);
                }
                f = nf;
        }
        cout << f[n];
}

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