Deleting Substrings

1000ms

262144K

Description:

SmallR likes a game called "Deleting Substrings". In the game you are given a sequence of integers w, you can modify the sequence and get points. The only type of modification you can perform is (unexpected, right?) deleting substrings. More formally, you can choose several contiguous elements of w and delete them from the sequence. Let's denote the sequence of chosen elements as w_l, w_l + 1, ..., w_r. They must meet the conditions:

the equality |w_i - w_i + 1| = 1 must hold for all i (l ≤ i < r);
the inequality 2·w_i - w_i + 1 - w_i - 1 ≥ 0 must hold for all i (l < i < r).

After deleting the chosen substring of w, you gain v_{r - l + 1} points. You can perform the described operation again and again while proper substrings exist. Also you can end the game at any time. Your task is to calculate the maximum total score you can get in the game.

Input:

The first line contains a single integer n (1 ≤ n ≤ 400) — the initial length of w. The second line contains n integers v₁, v₂, ..., v_n (0 ≤ |v_i| ≤ 2000) — the costs of operations. The next line contains n integers w₁, w₂, ..., w_n (1 ≤ w_i ≤ 10⁹) — the initial w.

Output:

Print a single integer — the maximum total score you can get.

Sample Input:

3
0 0 3
1 2 1

Sample Output:

Sample Input:

6
1 4 5 6 7 1000
2 1 1 2 2 3

Sample Output:

Informação

Provedor Codeforces

Código CF392E