矩阵连乘(java)

import java.util.Scanner;
public class Matrix{
    public static void main(String[] args) {
        Scanner inp=new Scanner(System.in);
        int n=inp.nextInt();
        int p[]=new int[n+1];
        int m[][]=new int[n+1][n+1];
        int s[][]=new int[n+1][n+1];
        for(int i=0;i<=n;i++)p[i]=inp.nextInt();
        M(n,p,m,s);
        System.out.print(T(1,n,s));
    }
    public static void M(int n,int p[],int m[][],int s[][]) {
        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]=p[i-1]*p[i]*p[j]+m[i+1][j];
                s[i][j]=i;
                for(int k=i+1;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;
                    }
                }
            }
        }
    }
    public static String T(int i,int j,int s[][]){
        if(i==j)return "A"+i;
        return "("+T(i,s[i][j],s)+T(s[i][j]+1,j,s)+")";
    }
}