Submission #19,187

19187

2025-11-28 14:49:14

cpp17

Accepted 35/35

25ms

1100 KiB

#include <iostream>
#include <vector>
using namespace std;

int main()
{
	int N;
	cin >> N;
	vector<int> list(N);
	for (int i = 0; i < N; i++)
	{
		cin >> list[i];
	}
	vector<int>dp(N);
	dp[0] = list[0];
	dp[1] = list[1] + list[0];
	for (int j = 2; j < N; j++)
	{
		if (dp[j - 1] < dp[j - 2])
			dp[j] = dp[j - 1] + list[j];
		else
			dp[j] = dp[j - 2] + list[j];
	}
	cout << dp[N - 1];
}

	Sum	Test	Verdict		Time	Memory
base	35/35
		1	Accepted	0/0	1ms	508 KiB
		2	Accepted	0/0	25ms	1080 KiB
		3	Accepted	1/1	1ms	316 KiB
		4	Accepted	1/1	1ms	316 KiB
		5	Accepted	1/1	1ms	316 KiB
		6	Accepted	1/1	1ms	316 KiB
		7	Accepted	1/1	1ms	376 KiB
		8	Accepted	2/2	1ms	512 KiB
		9	Accepted	2/2	1ms	408 KiB
		10	Accepted	2/2	2ms	316 KiB
		11	Accepted	2/2	3ms	316 KiB
		12	Accepted	2/2	2ms	316 KiB
		13	Accepted	2/2	3ms	316 KiB
		14	Accepted	2/2	6ms	564 KiB
		15	Accepted	2/2	8ms	524 KiB
		16	Accepted	2/2	13ms	608 KiB
		17	Accepted	2/2	17ms	940 KiB
		18	Accepted	2/2	19ms	820 KiB
		19	Accepted	2/2	21ms	1100 KiB
		20	Accepted	2/2	21ms	1016 KiB
		21	Accepted	2/2	24ms	1076 KiB
		22	Accepted	2/2	25ms	1060 KiB