public class memoizedmatrixChain {
//备忘录
//定义一个存储矩阵维度的数组
static int p[]= {1,2,3,4,5,6,7};
static int n=p.length-1;
static int [][]s=new int[n+1][n+1];
static int [][]m=new int [n+1][n+1];
public static void main(String[] args) {
// memoizedmatrixChain(n);
System.out.println(memoizedmatrixChain(n));
Traceback(s,1,2);
}
public static int memoizedmatrixChain(int n) {
for(int i=1;i<=n;i++) {
for(int j=i;j<=n;j++) {
m[i][j]=0;
}
}
return lookupChain(1,n);
}
private static int lookupChain(int i, int j) {
if(m[i][j]>0) return m[i][j];
if(i==j)return 0;
int u=lookupChain(i+1,j)+p[i-1]*p[i]*p[j];
s[i][j]=i;
for(int k=i+1;k<j;k++) {
int t=lookupChain(i,k)+lookupChain(k+1,j)+p[i-1]*p[i]*p[j];
if(t<u) {
u=t;
s[i][j]=k;
}
m[i][j]=u;
}
return m[i][j];
}
//通过递归的方法找到断点,并加括号
private static void Traceback(int[][] s,int i,int j) {
if(i==j) {
System.out.println("A"+i);
}else {
System.out.println("(");
Traceback(s,i,s[i][j]);
Traceback(s,s[i][j]+1,j);
System.out.println(")");
}
}
}
05-16
12-17
875