#include<iostream>
using namespace std;
#define MAXLEN 100
void MatrixChain(int p[MAXLEN],int n,int m[MAXLEN][MAXLEN],int s[MAXLEN][MAXLEN])
{
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[MAXLEN][MAXLEN])
{
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<<")";
}
}
int main(){
int p[MAXLEN]={30,35,15,5,10,20,25};
int m[MAXLEN][MAXLEN],s[MAXLEN][MAXLEN];
int n=6;
MatrixChain(p,n,m,s);
traceback(1,n,s);
cout<<endl;
return 0;
}
矩阵连乘---求几个矩阵乘积的最小值
猜你喜欢
转载自blog.csdn.net/wanwu_fusu/article/details/83065373
今日推荐
周排行