133432025-01-07 16:14:16BucsMateSzigetek (35 pont)cpp17Accepted 35/3526ms1416 KiB
#include <iostream>

using namespace std;

int dp[100001][2] = {};
int dijak[100001] = {};

int main()
{
    int N;
    cin >> N;
    for(int i = 1; i <= N; i++){
        cin >> dijak[i];
    }

    dp[1][0] = (1 << 29);
    dp[1][1] = dijak[1];
    for(int i = 2; i <= N; i++){
        dp[i][0] = dp[i-1][1];
        dp[i][1] = min(dp[i-1][0], dp[i-1][1]) + dijak[i];
    }
    cout << dp[N][1] << endl;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base35/35
1Accepted0/01ms500 KiB
2Accepted0/026ms1332 KiB
3Accepted1/11ms316 KiB
4Accepted1/11ms316 KiB
5Accepted1/11ms372 KiB
6Accepted1/11ms316 KiB
7Accepted1/11ms504 KiB
8Accepted2/21ms320 KiB
9Accepted2/21ms500 KiB
10Accepted2/22ms396 KiB
11Accepted2/22ms316 KiB
12Accepted2/22ms500 KiB
13Accepted2/23ms360 KiB
14Accepted2/26ms564 KiB
15Accepted2/28ms752 KiB
16Accepted2/213ms768 KiB
17Accepted2/217ms1032 KiB
18Accepted2/220ms1312 KiB
19Accepted2/223ms1332 KiB
20Accepted2/223ms1240 KiB
21Accepted2/225ms1416 KiB
22Accepted2/225ms1332 KiB