A22 - Sugoroku
https://atcoder.jp/contests/tessoku-book/tasks/tessoku_book_v
提出
code: python
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
# dpij := i 回目に j に止まった時の最大値
dp = [None * 2 for _ in range(n+1)]
dp10 = 100
dp11 = 150
# ゴールから逆算
解答
code: python
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
dp = -(10 ** 9) * (n+1)
dp1 = 0
for i in range(1, n):
dp[ai-1] = max(dp[ai-1], dpi + 100)
dp[bi-1] = max(dp[bi-1], dpi + 150)
print(dpn)