题解 | #牛牛吃草#

import java.util.Scanner;


public class Main {
    
    static final int N = 1010;
    static int[] f = new int[N];
    static int[] w = new int[N];
    static int[] a = new int[N];

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int max = 0;
        for(int i = 1; i <= n; i ++) w[i] = in.nextInt();
        for(int i = 1; i <= n; i ++) a[i] = in.nextInt();

        for(int i = n; i > 0; i --){
            int ww = w[i], aa = a[i];
            f[i] = ww;
            for(int j = i + aa; j <= n; j += aa){
                f[i] = Math.max(f[i], f[j] + ww);
            }
            max = Math.max(f[i], max);
        }
        System.out.println(max);
    }
}