Submission #9,406

2024-02-21 13:11:46

cpp17

Accepted 35/35

27ms

6088 KiB

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



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

	vector<int> dp(n, 0);
	dp[n-1]=szigetek[n-1];
	dp[n-2]=szigetek[n-1]+szigetek[n-2];
	dp[n-3]=szigetek[n-1]+szigetek[n-3];
	for (int i=n-4; i>=0; i--) {
		dp[i]=min(dp[i+1], dp[i+2])+szigetek[i];
	}
	cout << dp[0];
}

	Sum	Test	Verdict		Time	Memory
base	35/35
		1	Accepted	0/0	3ms	1812 KiB
		2	Accepted	0/0	27ms	3408 KiB
		3	Accepted	1/1	3ms	2264 KiB
		4	Accepted	1/1	3ms	2464 KiB
		5	Accepted	1/1	3ms	2636 KiB
		6	Accepted	1/1	3ms	2728 KiB
		7	Accepted	1/1	3ms	2856 KiB
		8	Accepted	2/2	3ms	3068 KiB
		9	Accepted	2/2	3ms	3192 KiB
		10	Accepted	2/2	3ms	3400 KiB
		11	Accepted	2/2	4ms	3620 KiB
		12	Accepted	2/2	4ms	3972 KiB
		13	Accepted	2/2	4ms	4236 KiB
		14	Accepted	2/2	7ms	4372 KiB
		15	Accepted	2/2	9ms	4712 KiB
		16	Accepted	2/2	14ms	5140 KiB
		17	Accepted	2/2	19ms	5360 KiB
		18	Accepted	2/2	21ms	5752 KiB
		19	Accepted	2/2	24ms	5860 KiB
		20	Accepted	2/2	25ms	5748 KiB
		21	Accepted	2/2	27ms	6000 KiB
		22	Accepted	2/2	27ms	6088 KiB