215892026-01-13 16:56:15algoproSzigetek (35 pont)cpp17Accepted 35/3527ms1972 KiB
// UUID: 585cc8e2-3703-402a-b9d6-933caf57ea73
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

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

    vector<long long> d(N + 1);
    for (int i = 1; i <= N; i++) {
        cin >> d[i];
    }
    vector<long long> dp(N + 1);

    dp[1] = d[1];
    if (N >= 2)
        dp[2] = d[1] + d[2];

    for (int i = 3; i <= N; i++) {
        dp[i] = d[i] + min(dp[i - 1], dp[i - 2]);
    }

    cout << dp[N] << endl;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base35/35
1Accepted0/01ms316 KiB
2Accepted0/027ms1972 KiB
3Accepted1/11ms316 KiB
4Accepted1/11ms316 KiB
5Accepted1/11ms316 KiB
6Accepted1/11ms316 KiB
7Accepted1/11ms508 KiB
8Accepted2/21ms316 KiB
9Accepted2/21ms316 KiB
10Accepted2/22ms420 KiB
11Accepted2/22ms316 KiB
12Accepted2/23ms316 KiB
13Accepted2/23ms316 KiB
14Accepted2/26ms564 KiB
15Accepted2/28ms648 KiB
16Accepted2/214ms1108 KiB
17Accepted2/217ms1468 KiB
18Accepted2/220ms1584 KiB
19Accepted2/223ms1612 KiB
20Accepted2/223ms1632 KiB
21Accepted2/226ms1960 KiB
22Accepted2/226ms1968 KiB