133422025-01-07 16:10:20BucsMateSzigetek (35 pont)cpp17Wrong answer 16/3526ms1844 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
base16/35
1Accepted0/01ms316 KiB
2Wrong answer0/026ms1844 KiB
3Wrong answer0/11ms316 KiB
4Accepted1/11ms316 KiB
5Accepted1/11ms316 KiB
6Accepted1/11ms316 KiB
7Accepted1/11ms316 KiB
8Wrong answer0/21ms316 KiB
9Accepted2/21ms316 KiB
10Wrong answer0/22ms316 KiB
11Accepted2/22ms316 KiB
12Accepted2/22ms508 KiB
13Wrong answer0/23ms424 KiB
14Wrong answer0/26ms548 KiB
15Accepted2/28ms872 KiB
16Wrong answer0/213ms968 KiB
17Wrong answer0/217ms1464 KiB
18Accepted2/219ms1484 KiB
19Wrong answer0/223ms1560 KiB
20Wrong answer0/223ms1708 KiB
21Accepted2/225ms1812 KiB
22Wrong answer0/226ms1748 KiB