8826 | 2024. 01. 31 17:24:14 | NagyLeo | Szigetek (35 pont) | python3 | Elfogadva 35/35 | 92ms | 37148 KiB |
def min_cost():
N = int(input())
fees = list(map(int, input().split()))
min_fees = [0] * N
min_fees[0] = fees[0]
min_fees[1] = fees[0] + fees[1]
for i in range(2, N):
min_fees[i] = min(min_fees[i - 1], min_fees[i - 2]) + fees[i]
return min_fees[N - 1]
print(min_cost())
Részfeladat | Összpont | Teszt | Verdikt | Idő | Memória | ||
---|---|---|---|---|---|---|---|
base | 35/35 | ||||||
1 | Elfogadva | 0/0 | 17ms | 10960 KiB | |||
2 | Elfogadva | 0/0 | 92ms | 32576 KiB | |||
3 | Elfogadva | 1/1 | 18ms | 11924 KiB | |||
4 | Elfogadva | 1/1 | 17ms | 12136 KiB | |||
5 | Elfogadva | 1/1 | 17ms | 12396 KiB | |||
6 | Elfogadva | 1/1 | 17ms | 12264 KiB | |||
7 | Elfogadva | 1/1 | 17ms | 12528 KiB | |||
8 | Elfogadva | 2/2 | 18ms | 12800 KiB | |||
9 | Elfogadva | 2/2 | 18ms | 13028 KiB | |||
10 | Elfogadva | 2/2 | 19ms | 13020 KiB | |||
11 | Elfogadva | 2/2 | 20ms | 13452 KiB | |||
12 | Elfogadva | 2/2 | 20ms | 14260 KiB | |||
13 | Elfogadva | 2/2 | 25ms | 14820 KiB | |||
14 | Elfogadva | 2/2 | 32ms | 16512 KiB | |||
15 | Elfogadva | 2/2 | 39ms | 18480 KiB | |||
16 | Elfogadva | 2/2 | 54ms | 22972 KiB | |||
17 | Elfogadva | 2/2 | 68ms | 28836 KiB | |||
18 | Elfogadva | 2/2 | 74ms | 30800 KiB | |||
19 | Elfogadva | 2/2 | 79ms | 33180 KiB | |||
20 | Elfogadva | 2/2 | 81ms | 35044 KiB | |||
21 | Elfogadva | 2/2 | 87ms | 36244 KiB | |||
22 | Elfogadva | 2/2 | 90ms | 37148 KiB |