矩阵连乘问题的概念和基本思路我这里就不写了,网上很多,随便百度一下就可以了.
偷个懒,呵呵~~~
//MatrixChain
//by xcz on 2013.9.3
#include <iostream>
using namespace std;
//递归求最优解
//i,j是计算连乘矩阵的下标,s记录断点的位置
int MatrixChain(int i,int j,int **s,int *p)
{
if (i==j)
return 0; //单个矩阵连乘次数为0
/*
int u = MatrixChain(i,i,s,p)+MatrixChain(i+1,j,s,p)+p[i-1]*p[i]*p[j];
s[i][j] = i;
for(int k=i+1; k<j; k++)
{
int t = MatrixChain(i,k,s,p) + MatrixChain(k+1,j,s,p) + p[i-1]*p[k]*p[j];
if(t<u)
{
u=t;
s[i][j]=k;
}
}
*/
int u =100000000;//先定义一个比较大的初始值
s[i][j] = i;
//从i开始依次取断点,递归求得最优解
for (int k=i ; k<j ; ++k)
{
int t=MatrixChain(i,k,s,p) + MatrixChain(k+1,j,s,p) +p[i-1]*p[k]*p[j];//计算此断点的计算次数
if (t<u)
{
u=t;
s[i][j] = k;
}
}
return u;
}
//构造最优解
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;
}
//A1 30*35 A2 35*15 A3 15*5 A4 5*10 A5 10*20 A6 20*25
//=>p[7]={30,35,15,5,10,20,25}
int main()
{
int p[7]={30,35,15,5,10,20,25};
int **s = new int *[7];
for (int i=0 ; i<7 ; ++i)
{
s[i]= new int[7];
}
cout<<"矩阵的最少计算次数为:"<<MatrixChain(1,6,s,p)<<endl;
cout<<"矩阵最优计算次序为:"<<endl;
Traceback(1,6,s);
system("pause");
return 0;
}