제출 #1125748

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1125748		Chinguun	K개의 묶음 (IZhO14_blocks)	C++20	0 / 100	0 ms	324 KiB

blocks

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

#define int long long
#define ff first
#define ss second
#define pb push_back
#define meta int tm = (tl + tr) / 2, x = i * 2 + 1, y = x + 1

const int N = 2e5 + 7;
const int oo = 1e9;
const int mod = 1e9 + 7;

typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vii;

int n, k, a[N], mn[N][107], dp[N][107], s;
stack <pii> st;
int p[N];

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

	cin >> n >> k;
	for (int i = 1; i <= n; i++) cin >> a[i];

	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= k; j++) {
			dp[i][j] = oo;
			mn[i][j] = oo;
		}
	}
	// dp[0][0] = 0;

	for (int i = 1; i <= n; i++) {
		while (!st.empty ()) {
			if (a[i] > st.top ().ff) st.pop ();
			else break;
		}
		if (!st.empty ()) s = st.top ().ss;
		for (int j = 1; j <= min(i, k); j++) {
			if (st.empty () || j > s) dp[i][j] = mn[i - 1][j - 1] + a[i];
			else dp[i][j] = min (a[i] + dp[s][j - 1], dp[s][j]);
			
			if (i == 1) mn[i][j] = dp[i][j];
			else mn[i][j] = min (mn[i - 1][j], dp[i][j]);
		}
		st.push ({a[i], i});
	}
	cout << dp[n][k] << ' ';
	return 0;
}

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