216012026-01-13 17:05:52algoproSzigetek (35 pont)cpp17Accepted 35/3525ms1124 KiB
// UUID: 0347c840-8b93-4931-afed-cf2d90891f7c
#include <bits/stdc++.h>
using namespace std;

int main() {
    int n;
    cin >> n;
    vector<int> dij(n), dp(n);
    for (int i =0; i < n; i++){
        cin >> dij[i];
    }
    dp[0] = dij[0];
    dp[1] = dp[0] + dij[1];
    for (int i = 2; i < n; i++){
        dp[i] = min(dp[i-1], dp[i-2]) + dij[i];
    }
    cout << dp[n-1];
}
SubtaskSumTestVerdictTimeMemory
base35/35
1Accepted0/01ms568 KiB
2Accepted0/025ms1076 KiB
3Accepted1/11ms316 KiB
4Accepted1/11ms316 KiB
5Accepted1/11ms404 KiB
6Accepted1/11ms316 KiB
7Accepted1/11ms316 KiB
8Accepted2/21ms316 KiB
9Accepted2/21ms316 KiB
10Accepted2/22ms316 KiB
11Accepted2/22ms508 KiB
12Accepted2/22ms316 KiB
13Accepted2/23ms316 KiB
14Accepted2/26ms316 KiB
15Accepted2/28ms568 KiB
16Accepted2/213ms564 KiB
17Accepted2/217ms960 KiB
18Accepted2/219ms1036 KiB
19Accepted2/221ms1076 KiB
20Accepted2/221ms1124 KiB
21Accepted2/224ms1076 KiB
22Accepted2/225ms1076 KiB