动态规划2

计算矩阵连乘积
在科学计算中经常要计算矩阵的乘积。矩阵A和B可乘的条件是矩阵A的列数等于矩阵B的行数。若A是一个p×q的矩阵，B是一个q×r的矩阵，则其乘积C=AB是一个p×r的矩阵。由该公式知计算C=AB总共需要pqr次的数乘。

#include<iostream>  
using namespace std; 
#define LEN 6
int p[LEN+1]={30,35,15,5,10,20,25};
int m[LEN+1][LEN+1]={0,0,0};
int s[LEN+1][LEN+1]={0,0,0};
void MatrixChain(int *p,int n,int m[][LEN+1],int s[][LEN+1])
{        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 < 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;}
              }    
      }  
  }

void traceback(int i,int j,int s[][LEN+1])
{
   if(i==j)
		cout<<"A"<<i;
	else if (i==j-1)
		cout<<"(A"<<i<<"A"<<j<<")";
	else
	{
		cout<<"(";
		traceback(i,s[i][j],s);
		traceback(s[i][j]+1,j,s);
		cout<<")";
	}
 }
  
void outputMatrix(int **matrix,int n,int m)  
{  
    for(int i=1;i<=n;i++)  
    {  
        for(int j=0;j<=m;j++)  
            cout<<matrix[i][j]<<"  ";  
        cout<<endl;  
    }  
}  
  
int main()  
{  
	MatrixChain(p,LEN,m,s);
	traceback(1,LEN,s);
	return 0;
}