矩阵连乘（动态规划）Java实现

要求：
1、编写用动态规划算法实现矩阵连乘的类。
2、编写一个测试类，给出矩阵链的行列数序列P，求计算该矩阵链乘积的完全加括号方式的最小代价，用二维表的形式输出各子矩阵链的最优值，，并将最优解构造出来。

算法实现：

public static void main(String[] args) {
  int[] p = { 30, 35, 15, 5, 10, 20, 25 };
  int n = p.length;
  int[][] m = new int[n][n];
  int[][] s = new int[n][n];
  matrixChain(p, m, s);
  System.out.println();
  TraceBack(s, 1, n - 1);
  System.out.println();
  OptimalParens(s, 1, n - 1);
 }


public static void matrixChain(int[] p, int[][] m, int[][] s) {
  int n = p.length - 1;
  for (int i = 1; i <= n; i++) {
   m[i][i] = 0;
  }
  for (int r = 2; r <= n; r++) {
   for (int i = 1; i <= n - r + 1; i++) {
    int j = i + r - 1;
    m[i][j] = 100000;
    s[i][j] = i;
    for (int k = i; k < j; k++) {
     int t = m[i][k] + m[k + 1][j] + p[i - 1] * p[k] * p[j];
     if (t < m[i][j]) {
      m[i][j] = t;
      s[i][j] = k;
     }
    }
   }
  }
  
  for (int i = 1; i < m.length; i++) {
   for (int j = 1; j < m.length; j++) {
    System.out.printf("%-8d ", m[i][j]);
   }
   System.out.println();
  }
  System.out.println();
  for (int i = 1; i < s.length; i++) {
   for (int j = 1; j < s.length; j++) {
    System.out.printf("%-8d", s[i][j]);
   }
   System.out.println();
  }
 }

public static void TraceBack(int[][] s, int i, int j) {
  if (i == j)
   return;
  TraceBack(s, i, s[i][j]);
  TraceBack(s, s[i][j] + 1, j);
  System.out.println("Multiply A" + i + "…" + s[i][j] + " and A"
    + (s[i][j] + 1) + "…" + j);
 }
 
public static void OptimalParens(int[][] s, int i, int j) {
  if (i == j) {
   System.out.print("A" + i);
  } else {
   System.out.print("(");
   OptimalParens(s, i, s[i][j]);
   OptimalParens(s, s[i][j] + 1, j);
   System.out.print(")");
  }
 }

算法实现结果：