231172026-01-16 12:35:13KassayAkosSzigetek (35 pont)cpp17Accepted 35/3525ms1076 KiB
#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n;
    cin >> n;
    vector <int> ar(n);
    for (int i=0;i<n;i++)
    {
        cin >> ar[i];
    }
    vector <int> dp(n, 0);
    dp[0]=ar[0];
    dp[1]=ar[1]+ar[0];
    for (int i=2;i<n;i++)
    {
        dp[i]=ar[i]+min(dp[i-1], dp[i-2]);
    }
    cout<<dp[n-1];
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base35/35
1Accepted0/01ms316 KiB
2Accepted0/025ms1072 KiB
3Accepted1/11ms508 KiB
4Accepted1/11ms316 KiB
5Accepted1/11ms316 KiB
6Accepted1/11ms316 KiB
7Accepted1/11ms316 KiB
8Accepted2/21ms316 KiB
9Accepted2/21ms316 KiB
10Accepted2/22ms316 KiB
11Accepted2/22ms316 KiB
12Accepted2/22ms500 KiB
13Accepted2/23ms316 KiB
14Accepted2/26ms476 KiB
15Accepted2/28ms564 KiB
16Accepted2/213ms612 KiB
17Accepted2/217ms940 KiB
18Accepted2/219ms980 KiB
19Accepted2/220ms892 KiB
20Accepted2/221ms1076 KiB
21Accepted2/224ms1076 KiB
22Accepted2/224ms1060 KiB