250542026-02-17 16:04:38info123Szigetek (35 pont)cpp17Accepted 35/3524ms1200 KiB
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
    int N;
    cin >> N;
    vector<int>n(N);
    vector<int>v(N);
    for (int i = 0; i < N; i++) {
        cin >> n[i];
    }
    v[0] = n[0];
    v[1] = n[0]+n[1];
    for (int i = 2; i < N; i++) {
        v[i] = min(v[i - 1], v[i - 2]) + n[i];
    }
    cout << v[N-1] << '\n';
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base35/35
1Accepted0/01ms316 KiB
2Accepted0/024ms1076 KiB
3Accepted1/11ms316 KiB
4Accepted1/11ms316 KiB
5Accepted1/11ms316 KiB
6Accepted1/11ms508 KiB
7Accepted1/11ms316 KiB
8Accepted2/21ms316 KiB
9Accepted2/21ms316 KiB
10Accepted2/22ms316 KiB
11Accepted2/22ms316 KiB
12Accepted2/22ms316 KiB
13Accepted2/23ms508 KiB
14Accepted2/24ms564 KiB
15Accepted2/28ms632 KiB
16Accepted2/213ms800 KiB
17Accepted2/217ms1012 KiB
18Accepted2/219ms1040 KiB
19Accepted2/221ms1096 KiB
20Accepted2/221ms1076 KiB
21Accepted2/224ms1084 KiB
22Accepted2/224ms1200 KiB