제출 #291325

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
291325		HynDuf	K개의 묶음 (IZhO14_blocks)	C++14	0 / 100	42 ms	1152 KiB

blocks

#include <bits/stdc++.h>

#define task "B"
#define all(v) (v).begin(), (v).end()
#define rep(i, l, r) for (int i = (l); i <= (r); ++i)
#define Rep(i, r, l) for (int i = (r); i >= (l); --i)
#define DB(X) { cerr << #X << " = " << (X) << '\n'; }
#define DB1(A, _) { cerr << #A << "[" << _ << "] = " << (A[_]) << '\n'; }
#define DB2(A, _, __) { cerr << #A << "[" << _ << "][" << __ << "] = " << (A[_][__]) << '\n'; }
#define DB3(A, _, __, ___) { cerr << #A << "[" << _ << "][" << __ << "][" << ___ << "] = " << (A[_][__][___]) << '\n'; }
#define PR(A, l, r) { cerr << '\n'; rep(_, l, r) DB1(A, _); cerr << '\n';}
#define SZ(x) ((int)(x).size())
#define pb push_back
#define eb emplace_back
#define pf push_front
#define F first
#define S second
#define by(x) [](const auto& a, const auto& b) { return a.x < b.x; } // sort(arr, arr + N, by(a));
#define next ___next
#define prev ___prev
#define y1 ___y1
#define left ___left
#define right ___right
#define y0 ___y0
#define div ___div
#define j0 ___j0
#define jn ___jn

using ll = long long;
using ld = long double;
using ull = unsigned long long;
using namespace std;
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<ll> vl;
const int N = 1e5 + 2;
int n, K, a[N], dp[2][N];
struct State
{
    int val, pos, pmn;
    State(int v, int p, int pm) : val(v), pos(p), pmn(pm) {}
};
deque<State> dq;
int main()
{
#ifdef HynDuf
    freopen(task".in", "r", stdin);
    //freopen(task".out", "w", stdout);
#else
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
#endif
    cin >> n >> K;
    rep(i, 1, n) cin >> a[i];
    int now = 0, lst = 1;
    rep(i, 1, n) dp[0][i] = 1e9;
    dp[0][0] = 0;
    rep(k, 1, K)
    {
        now ^= 1, lst ^= 1;
        dq.clear();
        dq.pb(State(1e9, 0, 1e9));
        dp[now][0] = 1e9;
        rep(i, 1, n)
        {
            while (dq.back().val <= a[i]) dq.pop_back();
            if (i >= k)
            {
                State tmp(a[i], i, min(dq.back().pmn, dp[lst][max(k - 1, dq.back().pos)] + a[i]));
                dq.pb(tmp);
            }

            dp[now][i] = dq.back().pmn;
        }
        //cerr << "Num seg: " << k << '\n';
        //rep(i, 0, n) cerr << dp[now][i] << " \n"[i == n];
    }
    cout << dp[now][n];
    return 0;
}

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