题解 | #牛牛吃草#
牛牛吃草
https://www.nowcoder.com/practice/f05254f070944ff792c0dfefabd94fec
n = int(input())
wi = [int(x) for x in input().split()]
ai = [int(x) for x in input().split()]
dp=[0]*n
for i in range(n):
dp[i]=wi[i]#初始化
for i in range(n):#枚举
tmp=0
for j in range(i):
if (i-j)%ai[j]==0: # 这个草能吃
tmp=max(dp[j],tmp) # 能吃的草，吃最大的
dp[i]=max(wi[i]+tmp,dp[i]) # 吃当前的草+能吃的草
print(max(dp))
#动态规划#