动态规划求解矩阵连乘问题JAVA实现
动态规划求解矩阵连乘问题JAVA实现import java.io.*;
//输入类
class Testio{ public static double readDouble() { try { return Double.valueOf(readString().trim()).doubleValue();} catch(NumberFormatException ne) { System.err.println("Console.readDouble:Not a double..."); System.exit(-1); return 0.0; } } public static int readInt() { try{return Integer.valueOf(readString().trim()).intValue();} catch(NumberFormatException ne){ System.err.println("Console.readInt:Not an integer...."); System.exit(-1); return -1; } } public static String readString() { String string=new String(); BufferedReader in=new BufferedReader(new InputStreamReader(System.in)); try{ string=in.readLine();} catch(IOException e) { System.out.println("Console.readInt:Not an integer...."); System.exit(-1); }return string; }}
//public class Juzhen{ public static void Matrix(int p[],int n,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]=m[i+1][j]+p[i-1]*p[i]*p[j]; s[i][j]=i; for(int k=i+1;k
public static void TrackBack(int i,int j,int s[][]){if(i==j) { System.out.print("A"+i); return ; }if(i