题解 | #牛牛吃草#

import java.util.Scanner;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int[] values = new int[n];
        int[] weight = new int[n];
        for (int i = 0; i < n; i++) {
            values[i] = in.nextInt();
        }
        for (int j = 0; j < n; j++) {
            weight[j] = in.nextInt();
        }
        int res = getRes(values, weight);
        System.out.print(res);
    }

    public static int getRes(int[] values, int[] weight) {
        int n = values.length;
        int[] dp = new int[n];

        dp[0] = values[0];
        int max = 0;
        for (int i = 1; i < n; i++) {
            dp[i] = values[i];
            for (int j = i - 1; j >= 0; j--) {
                if (weight[j] == 0) {
                    continue;
                }
                if ((i - j)  % weight[j] == 0) {
                    dp[i] = Math.max(dp[i], dp[j] + values[i]);
                }
            }
            if (max < dp[i]) {
                max = dp[i];
            }
        }
        return max;
    }
}