212412026-01-12 17:24:35algoproSzigetek (35 pont)pypy3Accepted 35/3575ms31724 KiB
# UUID: f71742c6-a565-45ef-9151-47193c3c8de1
n = int(input())
d = [int(x) for x in input().split()]

dp = [0] * n

dp[0] = d[0]
dp[1] = d[0] + d[1]

for i in range(2, n):
    dp[i] = d[i] + min(dp[i-1], dp[i-2])

print(dp[n-1])
SubtaskSumTestVerdictTimeMemory
base35/35
1Accepted0/039ms19616 KiB
2Accepted0/067ms31692 KiB
3Accepted1/141ms19408 KiB
4Accepted1/143ms19328 KiB
5Accepted1/145ms19432 KiB
6Accepted1/143ms19404 KiB
7Accepted1/141ms19424 KiB
8Accepted2/243ms21092 KiB
9Accepted2/248ms21432 KiB
10Accepted2/250ms21652 KiB
11Accepted2/250ms21744 KiB
12Accepted2/256ms21668 KiB
13Accepted2/250ms21592 KiB
14Accepted2/250ms22388 KiB
15Accepted2/252ms23264 KiB
16Accepted2/263ms25576 KiB
17Accepted2/270ms28552 KiB
18Accepted2/271ms29484 KiB
19Accepted2/264ms30496 KiB
20Accepted2/264ms30692 KiB
21Accepted2/275ms31720 KiB
22Accepted2/264ms31724 KiB