Submission #1306024

#	Time	Username	Problem	Language	Result	Execution time	Memory
1306024		annn	K개의 묶음 (IZhO14_blocks)	C++20	100 / 100	162 ms	82432 KiB

blocks

// Problem: K blocks
// Contest: Virtual Judge - OJUZ
// URL: https://vjudge.net/problem/OJUZ-IZhO14_blocks#author=0
// Memory Limit: 256 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

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

#define int long long
#define endl "\n"
#define pb push_back
#define ff first
#define ss second
#define ii pair<int, int>
#define vi vector<int>
#define vii vector<pair<int, int>>
#define yes cout << "YES\n"
#define no cout << "NO\n"
#define mii map<int, int>
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define all(a, len) (a) + 1, (a) + len + 1
#define vall(a) (a).begin(), a.end()
const int INF = 4e18;
const int MOD = 1e9 + 7;

int n, k; const int mx = 1e5 + 3, mxk = 103;
int a[mx], dp[mxk][mx];
void TheEminemShow() {
    cin >> n >> k;
    rep(i, 1, n) cin >> a[i];
}

void Recovery() {
	fill(&dp[0][0], &dp[0][0] + mxk*mx, INF);
	dp[1][0] = 0;
	rep(i, 1, n) dp[1][i] = max(dp[1][i-1], a[i]);
	
	for (int i = 2; i <= k; i++) {
		stack<ii> st;
		rep(j, i, n) {
			int mindp = dp[i-1][j-1];
			
			while (st.size() && a[st.top().ff] <= a[j]) {
				mindp = min(mindp, st.top().ss);
				st.pop();
			}
			
			if (st.size()) {
				dp[i][j] = min(dp[i][st.top().ff], mindp + a[j]);
			} else {
				dp[i][j] = min(dp[i][0], mindp + a[j]);
			}
			st.push({j, mindp});
		}
	}
	cout << dp[k][n];
}

void Kamikaze() {

}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);

    int TEST = 1;
    // cin >> TEST;
    while (TEST--) {
        TheEminemShow();
        Recovery();
        Kamikaze();
    }

    return 0;

}

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