236652026-01-27 08:37:03BitProSzigetek (35 pont)cpp17Accepted 35/3527ms1980 KiB
#include <iostream>
#include <vector>
using namespace std;

int n;
vector<long long int> arak, mincost;
void szigetek()
{
    for (int i = 2; i<n; i++) {
        mincost[i] = arak[i] + min(mincost[i-1], mincost[i-2]);
    }
}
int main()
{
    cin>>n;
    arak.resize(n);
    mincost.resize(n);
    for (int i=0; i<n; i++) {
        cin>>arak[i];
    }
    mincost[0] = arak[0];
    mincost[1] = arak[1] + mincost[0];
    szigetek();
    cout << mincost[n-1];
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base35/35
1Accepted0/01ms316 KiB
2Accepted0/026ms1844 KiB
3Accepted1/11ms508 KiB
4Accepted1/11ms508 KiB
5Accepted1/11ms316 KiB
6Accepted1/11ms388 KiB
7Accepted1/11ms316 KiB
8Accepted2/21ms316 KiB
9Accepted2/21ms316 KiB
10Accepted2/22ms508 KiB
11Accepted2/22ms316 KiB
12Accepted2/22ms316 KiB
13Accepted2/23ms316 KiB
14Accepted2/26ms732 KiB
15Accepted2/28ms816 KiB
16Accepted2/214ms1092 KiB
17Accepted2/218ms1400 KiB
18Accepted2/220ms1592 KiB
19Accepted2/223ms1588 KiB
20Accepted2/224ms1816 KiB
21Accepted2/227ms1844 KiB
22Accepted2/226ms1980 KiB