数据结构与算法 动态规划.pdf

3 3.1 3-1 [] 1 2 - 2s = 1d= 5 2 34 3 35 35 135 3 2 5 (9 ) 15 1 3 2 5 (11 ) 3 4 515 1 3 4 5 (9) v v v d 3-2 [0/1] 1 3 . 40 / 1x 1 . xn i = 1 2 . n xi x 1 = 0 2 3 . n c x 1 = 1 c-w1 r ? {c c-w1 } r x 1