矩阵连乘问题.cpp

前一阵出去玩了

#include <iostream.h>
void MatrixChain(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<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)
{
	if(i==j) return;
	Traceback(i,s[i][j],s);
	Traceback(s[i][j]+1,j,s);
	cout<<"Multiply A"<<i<<","<<s[i][j];
    cout<<"and A"<<(s[i][j]+1)<<","<<j<<endl;
}
void main()
{
      int i,n;
      cout<<"How long is your order?"<<endl;
      cin>>n;
      int *p=new int[n+1];int **s=new int *[n];int **m=new int *[n];
	  for (i=0;i<=n;i++)
		  s[i]=new int [n];
	  for (i=0;i<=n;i++)
		  m[i]=new int [n];
      cout<<"please input the inorde number"<<endl;
      for (i=0;i<=n;i++)
		  cin>>p[i];
      MatrixChain(p,n,m,s);
      Traceback(1,n,s);
}