Java实现矩阵连乘算法与优化

//矩阵连乘
import java.util.Scanner;
public class a {  
    public static void matrixMultiply(int[][] b, int[] p, int[][] s) {  
       int n = p.length-1;  
       for(int i = 1; i <= n; i++) 
          b[i][i] = 0;  //单个矩阵的计算量
      //r为每次循环矩阵链的长度
       for(int r = 2; r <= n; r++) 
           for(int i = 1; i <= n - r + 1; i++ ) {  
              int j = i + r - 1; 
              //取第一个可取位置，即断开位置为i
               b[i][j] = b[i + 1][j] + p[i - 1] * p[i] * p[j];  
               s[i][j] = i;  
             //循环取K得可取位置 
               for(int k = i + 1; k < j; k++) { 
                   int t = b[i][k] + b[k + 1][j] + p[i - 1] * p[k] * p[j];  
                  if(t < b[i][j]) {
                      b[i][j] = t;  
                        s[i][j] = k;   
                   }  
              }  
         }   
    }  
    public static void traceback(int[][] s, int i, int j) 
    {  
           if(i == j) System.out.print("A" + i);
           else   if(i+1==j) System.out.print("(A" + i+"A"+j+")");
           else
           {