220582026-01-14 16:37:05algoproSzigetek (35 pont)cpp17Wrong answer 2/3525ms1076 KiB
// UUID: 7be9e220-fb14-45bf-9aa8-4f72246a4be3
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n;
    cin>>n;
    vector<int>k(n);
    for(int i=0;i<n;i++){
        cin>>k[i];
    }
vector<int>dp(n);
dp[0]=k[0];
    dp[1]=k[1];
    for(int i=2;i<n;i++){
        dp[i]=min(dp[i-1], dp[i-2])+k[i];
    }
cout<<dp[n-1]+1<<endl;
// for(int i=0;i<n;i++) cout<<dp[i]<<" ";
}
SubtaskSumTestVerdictTimeMemory
base2/35
1Accepted0/01ms316 KiB
2Wrong answer0/025ms1076 KiB
3Wrong answer0/11ms316 KiB
4Accepted1/11ms316 KiB
5Accepted1/11ms316 KiB
6Wrong answer0/11ms324 KiB
7Wrong answer0/11ms316 KiB
8Wrong answer0/21ms316 KiB
9Wrong answer0/21ms508 KiB
10Wrong answer0/22ms508 KiB
11Wrong answer0/22ms316 KiB
12Wrong answer0/22ms348 KiB
13Wrong answer0/23ms316 KiB
14Wrong answer0/24ms316 KiB
15Wrong answer0/28ms516 KiB
16Wrong answer0/213ms756 KiB
17Wrong answer0/217ms944 KiB
18Wrong answer0/219ms988 KiB
19Wrong answer0/221ms1076 KiB
20Wrong answer0/221ms1020 KiB
21Wrong answer0/225ms1060 KiB
22Wrong answer0/225ms1056 KiB