207242026-01-08 18:14:56KoszorusBlankaSzigetek (35 pont)cpp17Accepted 35/3525ms1580 KiB
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    int N;
    cin >> N;

    vector<int> Dij(N);
    for (int i = 0; i < N; i++) {
        cin >> Dij[i];
    }

    vector<int>ossz(N, 0);

    ossz[0] = Dij[0];
    ossz[1] = Dij[0] + Dij[1];

    for (int i = 2; i < N; i++) {
        ossz[i] = Dij[i] + min(ossz[i - 1], ossz[i - 2]);
    }

    cout << ossz[N - 1];

    return 0;
}
SubtaskSumTestVerdictTimeMemory
base35/35
1Accepted0/01ms316 KiB
2Accepted0/025ms1580 KiB
3Accepted1/11ms316 KiB
4Accepted1/11ms316 KiB
5Accepted1/11ms316 KiB
6Accepted1/11ms316 KiB
7Accepted1/11ms508 KiB
8Accepted2/21ms316 KiB
9Accepted2/21ms316 KiB
10Accepted2/22ms316 KiB
11Accepted2/22ms508 KiB
12Accepted2/22ms316 KiB
13Accepted2/23ms316 KiB
14Accepted2/24ms480 KiB
15Accepted2/28ms628 KiB
16Accepted2/213ms604 KiB
17Accepted2/217ms960 KiB
18Accepted2/219ms820 KiB
19Accepted2/221ms1348 KiB
20Accepted2/221ms1024 KiB
21Accepted2/224ms1336 KiB
22Accepted2/224ms1064 KiB