矩阵链乘法（动态规划）

问题描述

算法设计与实践第8次作业：问题：设A1,A2,……，An为n个矩阵的序列，其中Ai为Pi-1×Pi阶矩阵，这个矩阵链的输入用向量P=<P0,P1,……,Pn>给出。
给定向量P，确定一种乘法次序，是的具备运算的总次数达到最小。

解析

Ai…j：表示矩阵链相乘的子问题AiAi+1…Aj；
m[i…j]：表示得到乘积Ai…j所用的最少基本运算次数；
假定，最后一次相乘发生在矩阵链Ai…k和Ak+1…j之间，即
AiAi+1…Aj=(AiAi+1…Ak)(Ak+1Ai+2…Aj) k=i,i+1,…,j-1
e.g.,Ai(Ai+1…Aj);(AiAi+1)(Ai+2…Aj);…;(AiAi+1Ai+2…)(Aj-1Aj);(AiAi+1Ai+2…Aj-1)Aj
m[i…j]=
其中Ai=Pi-1×Pi，Ak=Pk-1×Pk，Aj=Pj-1×Pj
AiAi+1…Aj=(AiAi+1…Ak)(Ak+1Ai+2…Aj)
→(Pi-1Pk)(PkPj)
→Pi-1PkPj

示例

P=<5,10,25,5,15,20>,n=5
A1:5×10
A2:10×25
A3:25×5
A4:5×15
A5:15×20

(1)r=1
m[1,1]=0;
m[2,2]=0;
m[3,3]=0;
m[4,4]=0;
m[5,5]=0;

(2)r=2,i=1,2,3,4;j=2,3,4,5
m[1,2]=5×10×25=1250;
m[2,3]=10×25×5=1250;
m[3,4]=25×5×15=1875;
m[4,5]=5×15×20=1500;

(3)r=3;i=1,2,3;j=3,4,5
m[1,3]=min{m[1,2]+m[3,3]+(A1A2)A3,m[1,1]+m[2,3]+A1(A2A3)}=1500;s[1,3]=1;
m[2,4]=min{m[2,3]+m[4,4]+(A2A3)A4,m[2,2]+m[3,4]+A2(A3A4)}=2000;s[2,4]=3;
m[3,5]=min{m[3,4]+m[5,5]+(A3A4)A5,m[3,3]+m[4,5]+A3(A4A5)}=4000;s[3,5]=3;

(4)r=4;i=1,2;j=4,5
m[1,4]=min{m[1,1]+m[2,4]+A1(A2A3A4),m[1,2]+m[3,4]+(A1A2)(A3A4).m[1,3]+m[4,4]+(A1A2A3)A4}=1875;s[1,4]=3;
m[2,5]=min{m[2,2]+m[3,5]+A2(A3A4A5),m[2,3]+m[4,5]+(A2A3)(A4A5),m[2,4]+m[5,5]+(A2A3A4)A5}=3750;s[2,5]=3;

设计

输入：矩阵链Ai…j的输入向量P=<Pi-1,Pi,…Pj> 1≤i≤j≤n
输出：计算Ai…j所需最小乘法运算次数m[i…j]和最后一次运算的位置s[i…j]
另所有m[i,j]初值为0，s[i,j]的初值为i 1≤i≤j≤n
For r=2 to n do
 For i=1 to n-r+1 do
  j=i+r-1
  m[i,j]=m[i+1,j]+Pi-1PkPj
  s[i,j]=i
  For k=i+1 to j-1 do
   t =m[i,k]+m[k+1,j]+Pi-1PkPj
   if t<m[i,j]
   Then m[i,j]=t
   s[i,j]=k
   核心代码：

#include <iostream>
#include <string.h>
using namespace std;
int const M = 10;

void print(int s[][M],int i,int j) {
	if (i == j) cout << "A" << i;
	else
	{
		cout << "(";
		print(s, i, s[i][j]);
		print(s, s[i][j] + 1, j);
		cout << ")";
	}
}
int main()
{
	cout << "输入向量P长度小于" << M << "";
	int length;
	cin >> length;
	cout << "输入向量P:";
	int P[M] = { 0 };
	for (int i = 0; i < length; i++) {
		cin >> P[i];
	}
	int m[M][M], s[M][M];
	int t, n = length - 1;

	
	for (int i = 1; i <= n; i++) {
		for (int j = 0; j <= n; j++) {
			m[i][j] = 0;
			s[i][j] = 1;
		}
	}
	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 - 1; k++){
				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;
				}
			}
		}
	}
	cout << "当矩阵链规模为" << length << "时：" << endl;
	cout << "最小总次数为" << m[1][n] << endl;
	cout << "括号化方案为："<<endl;
	
	print(s, 1, n);
	cout << endl;

}

复杂度

GitHub源码