๋ฌธ์
https://www.acmicpc.net/problem/11052
ํ์ด
# ๋ฐฑ์ค 11052๋ฒ ๋ฌธ์ - ์นด๋ ๊ตฌ๋งคํ๊ธฐ
n = int(input())
p = [0] + list(map(int, input().split()))
dp = [0 for _ in range(n+1)]
for i in range(1, n+1):
for k in range(1, i+1):
dp[i] = max(dp[i], dp[i-k] + p[k])
print(dp[i])
'๐๏ธ Algorithm > ๐ฉ ๋ฐฑ์ค' ์นดํ ๊ณ ๋ฆฌ์ ๋ค๋ฅธ ๊ธ
๐ฉ [๋ฐฑ์ค] [Python] 1743๋ฒ_์์๋ฌผ ํผํ๊ธฐ (0) | 2022.12.07 |
---|---|
๐ฉ [๋ฐฑ์ค] [Python] 9465๋ฒ_์คํฐ์ปค (0) | 2022.12.02 |
๐ฉ [๋ฐฑ์ค] [Python] 17086๋ฒ_์๊ธฐ ์์ด 2 (0) | 2022.12.02 |
๐ฉ [๋ฐฑ์ค] [Python] 11060๋ฒ_์ ํ ์ ํ (0) | 2022.11.28 |
๐ฉ [๋ฐฑ์ค] [Python] 2210๋ฒ_์ซ์ํ ์ ํ (0) | 2022.11.28 |