제출 #948239

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
948239		brendonw	Rabbit Carrot (LMIO19_triusis)	C++17	35 / 100	163 ms	196860 KiB

triusis

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MAX_A = 5e3;

int solve() {
	int n, m;
	cin >> n >> m;
	vector<int> a(n);
	for (auto &a_i: a) {
		cin >> a_i;
	}
	vector<vector<int>> dp(n + 1, vector<int>(MAX_A + 1, 3e5));
	dp[0] = {0};
	vector<vector<int>> suffix(n + 1, vector<int>(MAX_A + 2, 3e5));
	suffix[0][0] = 0;
	for (int i = 1; i <= n; ++i) {
		for (int h = MAX_A; h >= 0; --h) {
			dp[i][h] = (a[i - 1] != h) + suffix[i - 1][max(h - m, 0)];
			suffix[i][h] = min(suffix[i][h + 1], dp[i][h]);
		}
	}
	cout << *min_element(dp[n].begin(), dp[n].end());

	return 0;
}

#ifndef MY_UNIT_TEST

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	solve();
}

#endif

• Subtask 1: 14 / 14
• Subtask 2: 21 / 21
• Subtask 3: 0 / 28
• Subtask 4: 0 / 37