Submission #8,399

2024-01-15 15:35:14

cpp17

Accepted 35/35

27ms

5136 KiB

// Source: https://usaco.guide/general/io

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

int main() {
	int n; cin >> n;
	vector<int> cost(n);
	for (int i = 0; i < n; i++) {
		cin >> cost[i];
	}

	vector<int> dp(n+1);
	dp[0] = cost[0];
	dp[1] = cost[0] + cost[1]; 
	for (int i = 2; i < n; i++) {
		dp[i] = min(dp[i-1], dp[i-2]) + cost[i];
		// cerr << dp[i] << endl;
	}
	cout << dp[n-1];
}

	Sum	Test	Verdict		Time	Memory
base	35/35
		1	Accepted	0/0	3ms	1820 KiB
		2	Accepted	0/0	26ms	3432 KiB
		3	Accepted	1/1	3ms	2188 KiB
		4	Accepted	1/1	3ms	2396 KiB
		5	Accepted	1/1	3ms	2624 KiB
		6	Accepted	1/1	3ms	2556 KiB
		7	Accepted	1/1	3ms	2796 KiB
		8	Accepted	2/2	3ms	3056 KiB
		9	Accepted	2/2	3ms	3088 KiB
		10	Accepted	2/2	3ms	3140 KiB
		11	Accepted	2/2	4ms	3280 KiB
		12	Accepted	2/2	4ms	3368 KiB
		13	Accepted	2/2	4ms	3404 KiB
		14	Accepted	2/2	7ms	3760 KiB
		15	Accepted	2/2	9ms	3688 KiB
		16	Accepted	2/2	14ms	4196 KiB
		17	Accepted	2/2	19ms	4416 KiB
		18	Accepted	2/2	21ms	4912 KiB
		19	Accepted	2/2	24ms	4840 KiB
		20	Accepted	2/2	24ms	4968 KiB
		21	Accepted	2/2	26ms	5136 KiB
		22	Accepted	2/2	27ms	5136 KiB