动态规划之钢条切割

先附上代码：

package dynamicprogramming;


public class Case01 {


// 切管子


public static void main(String args[]) {


// 管子长度以及对应成本
int[] len = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
int[] price = { 0, 1, 5, 8, 9, 10, 17, 17, 20, 24, 30 };


// 前驱结点设为空
int[] pre = new int[11];


// 定义最优解数组
int[] result = new int[11];


for (int i = 0; i < pre.length; i++) {


pre[i] = -1;
result[i] = -1;


}


result[1] = 1;


for (int i