[python/파이썬] 백준 11060 점프 점프

[문제 출처]

https://www.acmicpc.net/problem/11060

11060번: 점프 점프

 

[문제 풀이]

 

import sys
input = sys.stdin.readline

n = int(input())
jumps = list(map(int, input().split()))

dp = [n+1] * n
dp[0] = 0

for i in range(n):
    for j in range(1, jumps[i]+1):
        if i+j>=n:
            break
        
        dp[i+j] = min(dp[i+j], dp[i]+1)

if dp[n-1] > n:
    print(-1)
else:
    print(dp[n-1])