Advertisement
zhukov000

Buy tickets

Nov 27th, 2019
218
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Python 0.29 KB | None | 0 0
  1. n = int(input())
  2. inf = 3601
  3. a, b, c = [inf] * (n+1), [inf] * (n+1), [inf] * (n+1)
  4. for i in range(1, n+1):
  5.   a[i], b[i], c[i] = map(int, input().split())
  6.  
  7. dp = [0, a[1]] + [inf] * n
  8.  
  9. for i in range(2, n+1):
  10.   dp[i] = min(dp[i-1] + a[i], dp[i-2] + b[i-1], dp[i-3] + c[i-2])
  11.  
  12. print(dp[n])
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement