算法导论之矩阵连乘

最大链乘法，我们都知道，对于多个矩阵的乘法，我们如果按照通常的方式进行乘法，可能最好的情况和最差的情况相差十倍之上，以下给出了寻找最好的分割组合方式来实现矩阵的乘法：

算法实现参照《算法导论》第二版

#include<iostream>
#define MAX numeric_limits<int>::max() 
using namespace std;
int** matrix_chain_order(int *p,int n);
void print_optimal_parens(int **s,int i,int j);
int main()
{
cout<<"请输入矩阵的个数："<<endl;
int n;
cin>>n;
int *p = new int[n+1];
for(int i = 0; i<n+1; ++i)
{
cout<<"请输入p["<<i<<"] = ";
cin>>p[i];
}
int **s = matrix_chain_order(p,n);
print_optimal_parens(s,1,n);
system("pause");
return 0;
}
int** matrix_chain_order(int *p, int n)
{
int **m = new int*[n+1];
int **s = new int*[n+1];
for(int i = 0; i < n+1; ++i)
{
s[i] = new int[n];
m[i] = new int[n+1];
}


for(int i = 0; i< n+1; ++i)
for(int j = 0; j < n+1; ++j)
{
m[i][j] = 0;
s[i][j] = 0;
}
for(int l = 2; l<= n; ++l)
for( int i = 1; i<= n-l+1; ++i)
{
int j = i+l-1;
m[i][j] = MAX;
for(int k = i; k <= j-1; ++k)
{
int q = m[i][k]+m[k+1][j]+p[i-1]*p[k]*p[j];
if(q < m[i][j])
{
m[i][j] = q;
s[i][j] = k;
}
}
}

for(int i = 0; i< n+1; ++i)
{
for(int j = 0; j < n+1; ++j)
{
cout<< s[i][j]<<"   ";
}
cout<<endl;
}

return s;
}
void print_optimal_parens(int **s,int i,int j)
{
if( i == j)
cout<<"A"<<i;
else
{
cout<<'(';
print_optimal_parens(s,i,s[i][j]);
print_optimal_parens(s,s[i][j]+1,j);
cout<<')';
}
}