215882026-01-13 16:55:57algoproSzigetek (35 pont)cpp17Accepted 35/3526ms1972 KiB
// UUID: 73ec6ebe-5088-460c-b361-28144003cb41
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
	ll n;
	cin >> n;
	vector <ll> kikoto(n);
	for ( ll i = 0; i < n; i++ ){
		cin >> kikoto[i];
	}
	vector <ll> dp(n);
	dp[0] = kikoto[0];
	dp[1] = kikoto[0] + kikoto[1];
	for ( ll i = 2; i < n; i++ ){
		dp[i] = min(dp[i-1], dp[i-2])+kikoto[i];
	}
	cout << dp[n-1] << "\n";
}
SubtaskSumTestVerdictTimeMemory
base35/35
1Accepted0/01ms316 KiB
2Accepted0/026ms1840 KiB
3Accepted1/11ms316 KiB
4Accepted1/11ms316 KiB
5Accepted1/11ms316 KiB
6Accepted1/11ms316 KiB
7Accepted1/11ms316 KiB
8Accepted2/21ms316 KiB
9Accepted2/21ms412 KiB
10Accepted2/22ms316 KiB
11Accepted2/22ms500 KiB
12Accepted2/22ms380 KiB
13Accepted2/23ms316 KiB
14Accepted2/26ms588 KiB
15Accepted2/28ms656 KiB
16Accepted2/213ms1052 KiB
17Accepted2/217ms1472 KiB
18Accepted2/220ms1552 KiB
19Accepted2/223ms1616 KiB
20Accepted2/223ms1620 KiB
21Accepted2/225ms1956 KiB
22Accepted2/226ms1972 KiB