动态规划

package F30;


import java.util.Scanner;
/*
 *标准化输出
5
9
12 15
10 6 8
2 18 9 5
19 7 10 4 16
max=59
9->
12->
10->
18->
10
 */
public class F32 {
public static void main(String[] args) {//采用3维数组分别为原数组，选优数组和
int a[][][] = new int[50][50][4];
int i = 0;
int j = 0;
int n = 0;
Scanner scanner = new Scanner(System.in);
n = scanner.nextInt();
for (i = 1; i <= n; i++) {// 初始化
scanner.nextLine();
for (j = 1; j <= i; j++) {
a[i][j][1] = scanner.nextInt();
a[i][j][2] = a[i][j][1];// 存加过的数值
a[i][j][3] = 0;//状态值
}
}


for (i = n - 1; i >= 1; i--) {
for (j = 1; j <= i; j++) {
if (a[i + 1][j][2] > a[i + 1][j + 1][2]) {
a[i][j][2] = a[i][j][2] + a[i + 1][j][2];
a[i][j][3] = 0;// 选左边那个数字
} else {
a[i][j][2] = a[i][j][2] + a[i + 1][j + 1][2];
a[i][j][3] = 1;// 选右右边那个数字
}
}


}
System.out.println("max=" + a[1][1][2]);// 最大值为最顶端的那个数字
//输出具体的选择
j = 1;
for (i = 1; i <= n - 1; i++) {
System.out.println(a[i][j][1] + "->");
j = j + a[i][j][3];//看往左走还是往右走
}
System.out.println(a[n][j][1]);//输出最后一个
}
}