矩阵链乘法

1. 问题
   设A1，A2…An为n个矩阵的序列，其中Ai为Pi-1×Pi阶矩阵，这个矩阵的输入用向量P=<P0,P1….Pn>给出；给定向量P，确定一种乘法次序，使得基本运算的总次数达到最小。
2. 解析
   动态规划
   
   

m[1,3] = min{ m[1,1]+m[2,3]+A1(A2A3),m[1,2]+m[3,3]+(A1A2)A3}; s[1,3] = 1
m[2,4] = min{m[2,2]+m[3,4]+A2(A3A4),m[2,3]+m[4,4]+(A2A3)A4}; s[2,4] = 3
m[1,4] = min{m[1,1]+[2,4]+A1(A2A3A4), m[1,2]+[3,4] +(A1A2)(A3A4), m[1,3]+[4,4] +(A1A2A3)A4}; s[1,4] = 3
3.设计

4.分析
时间复杂度O(n^3)
5.源码

https://github.com/woshichunchongchong/Algorithm_hw/blob/main/%E7%9F%A9%E9%98%B5%E9%93%BE%E4%B9%98%E6%B3%95.cpp

#include
#include<string.h>
#include
#define MAX_SIZE 100
using namespace std;

int n, m;
int dp[MAX_SIZE][MAX_SIZE]; //乘积Ai…j所用的最少基本运算次数
int pos[MAX_SIZE][MAX_SIZE]; //最后一次乘法运算的位置
int p[MAX_SIZE];

int main() {
cout << “n的值：”;
cin >> n;
cout << “请输入向量p的元素：”;
for (int i = 0; i < n; ++i) {
cin >> p[i];
}

//dp 迭代 
for (int i = 1; i < n; i++) {
	dp[i][i] = 0;
}
for (int m = 2; m < n; m++) {
	for (int i = 1; i < n - m + 1; i++) {
		int j = i + m - 1;
		dp[i][j] = dp[i + 1][j] + p[i - 1] * p[i] * p[j];
		pos[i][j] = i;
		for (int k = i; k <= j - 1; k++) {
			int tmp = dp[i][k] + dp[k + 1][j] + p[i - 1] * p[k] * p[j];
			if (tmp < dp[i][j]) {
				dp[i][j] = tmp;
				pos[i][j] = k;
			}
		}
	}
}

cout << "乘积为：" << dp[1][n - 1] << endl;
cout << "最小次数为：" << pos[1][n - 1] << endl;

}