Solved! Difficulty: Div2E 思考题for everyone Dynamic DP You are given: integer arrays A and dp of length N. integer arrays l and r of length N. For each 2\leq i\leq N,1\leq l_i\leq r_i\leq i-1 Known: dp_1=A_1 dp_i=min(dp[l_i,r_i])+A_i for 2\l……