Xiao Long Bao

N dumplings sit in a row, all starting with flavor 0. Eating dumpling $i$ adds $A_i$ flavor to every uneaten dumpling $j$ with $|i-j| \le D_i$. Maximize the total flavor you consume.

Line 1: $N$. Line 2: splatter distances $D_i$. Line 3: splash values $A_i$.

Print the maximum total flavor.