返回题解分享
讨论 / 题解分享/ 帖子详情

充电 - 题解

n = int(input())
ls = [0]*(n+5)
for i in range(n):
    a,b = map(int,input().split())
    ls[i] = [a,b]

dp = [0]*(n+5)

for i in range(n-1,-1,-1):
    dp[i] = dp[i+1]
    c = i + ls[i][1]+1
    dp[i] = max(dp[i],ls[i][0]+(dp[c] if c<n else 0 ))

print(max(dp))
0 回复 0 转发 0 喜欢 1 阅读
回复 (0)
默认 最新
暂无回复,快来抢沙发!