Submission #21,576

2026-01-13 16:42:58

cpp17

Accepted 35/35

25ms

1116 KiB

// UUID: 231306d3-c2bd-4f21-a514-a2fe17500048
#include <bits/stdc++.h>
using namespace std;

int main() {
	int N;
    cin >> N;
    vector<int>koltseg(N);
    for(int i = 0; i < N; i++){
        cin >> koltseg[i];
    }
    vector<int>DP(N);
    DP[0] = koltseg[0];
    DP[1] = koltseg[0] + koltseg[1];
    for(int i = 2; i < N; i++){
        DP[i] = min(DP[i-1], DP[i-2])+  koltseg[i];
    }
    cout << DP[N-1];
}

	Sum	Test	Verdict		Time	Memory
base	35/35
		1	Accepted	0/0	1ms	500 KiB
		2	Accepted	0/0	25ms	1076 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	316 KiB
		8	Accepted	2/2	1ms	316 KiB
		9	Accepted	2/2	1ms	316 KiB
		10	Accepted	2/2	2ms	316 KiB
		11	Accepted	2/2	2ms	316 KiB
		12	Accepted	2/2	2ms	316 KiB
		13	Accepted	2/2	3ms	432 KiB
		14	Accepted	2/2	6ms	564 KiB
		15	Accepted	2/2	8ms	512 KiB
		16	Accepted	2/2	13ms	608 KiB
		17	Accepted	2/2	17ms	952 KiB
		18	Accepted	2/2	19ms	984 KiB
		19	Accepted	2/2	21ms	1032 KiB
		20	Accepted	2/2	21ms	1020 KiB
		21	Accepted	2/2	24ms	1116 KiB
		22	Accepted	2/2	25ms	1056 KiB