题解 | #牛牛吃草#
牛牛吃草
https://www.nowcoder.com/practice/f05254f070944ff792c0dfefabd94fec
import java.util.*;
// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[] w = new int[n];
int[] a = new int[n];
int[] f = new int[n];
for (int i = 0; i < n; i++) {
w[i] = in.nextInt();
f[i] = w[i];
}
for (int i = 0; i < n; i++) {
a[i] = in.nextInt();
}
int ans = 0;//最终的最大值
for (int i=0; i<n; i++) {
for (int j=0; j<i; j++) {
if ((i-j)%a[j]==0) {
f[i] = Math.max(f[i], f[j] + w[i]);
}
}
}
for (int i=0; i<n; i++) {
ans = Math.max(ans, f[i]);
}
System.out.print(ans);
}
}
