矩阵连乘算法 c++.doc

include
#include
using namespace std;

class MatrixChain
{
public:
MatrixChain(int *q,int mSize);
~MatrixChain();
int MChain();
void print();
private:
void print(int i,int j);
int *p;
int **m,**s;
int n;
};

void MatrixChain::print(int i,int j)
{
ifi==j)
{
cout<s[i][j]+1)
cout<<'(';
print(s[i][j]+1,j);
if(j>s[i][j]+1)
cout<<')';
}

void MatrixChain::print()
{
//cout<<'(';
print(0,n-1);
//cout<<')';
}

int MatrixChain::MChain()
{
for(int i=0;i[j]+p[i]*p[k+1]*p[j+1];
if(tempi=0;i