算法之矩阵链乘法问题

1. packagecom.eshore.sweetop.dynamicprogramming;
3. publicclassMatrixChain{
4. publicstaticvoidorder(int[]p){
5. intn=p.length-1;
6. int[][]m=newint[n][n];
7. int[][]s=newint[n][n];
8. for(inti=0;i<n;i++){
9. m[i][i]=0;
10. }
12. for(intl=2;l<n+1;l++){
13. for(inti=0;i<n-l+1;i++){
14. intj=i+l-1;
15. m[i][j]=Integer.MAX_VALUE;
16. for(intk=i;k<j;k++){
17. intq=m[i][k]+m[k+1][j]+p[i]*p[k+1]*p[j+1];
18. if(q<m[i][j]){
19. m[i][j]=q;
20. s[i][j]=k;
21. }
22. }
23. }
24. }
26. Matrix.halfdisplay(m);
28. parens(s,0,s.length-1);
29. }
31. publicstaticvoidparens(int[][]s,inti,intj){
32. if(i==j){
33. System.out.print("A"+(i+1));
34. }else{
35. System.out.print("(");
36. parens(s,i,s[i][j]);
37. parens(s,s[i][j]+1,j);
38. System.out.print(")");
39. }
40. }
42. publicstaticvoidmain(String[]args){
43. //int[]p={30,35,15,5,10,20,25};
44. int[]p={5,10,3,12,5,50,6};
45. MatrixChain.order(p);
46. }
47. }