Submission #732992

#	Time	Username	Problem	Language	Result	Execution time	Memory
732992		GrindMachine	K blocks (IZhO14_blocks)	C++17	53 / 100	1083 ms	600 KiB

blocks

// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll n, k; cin >> n >> k;
    vector<ll> a(n + 5);
    rep1(i, n) cin >> a[i];
    a[0] = inf2;

    vector<ll> dp1(n + 5, inf2);
    dp1[0] = 0;

    rep1(t, k) {
        vector<ll> dp2(n + 5, inf2);
        rep1(i, n) {
            ll mx = -inf2;
            rev(j, i, 1) {
                amax(mx, a[j]);
                amin(dp2[i], mx + dp1[j - 1]);
            }
        }

        dp1 = dp2;
    }

    ll ans = dp1[n];
    cout << ans << endl;

    // rep1(t, k) {
    //     vector<ll> dp2(n + 5, inf2);
    //     stack<array<ll, 3>> st;
    //     // (j,rangemn,prefmn)
    //     st.push({0, inf2, inf2});

    //     rep1(i, n) {
    //         ll mn = inf2;
    //         while (true) {
    //             auto [j, mndp, mnval] = st.top();
    //             if (a[j] > a[i]) break;

    //             amin(mn, mndp);
    //             amin(mn, dp1[j]);

    //             st.pop();
    //         }

    //         {
    //             auto [j, mndp, mnval] = st.top();
    //             amin(mn, dp1[j]);
    //             ll val = a[i] + mn;
    //             dp2[i] = val;
    //             amin(mnval, val);
    //             st.push({i, mn, mnval});
    //         }
    //     }

    //     dp1 = dp2;
    // }

    // ll ans = dp1[n];
    // cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

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