【动态规划算法3.1】矩阵连乘问题（C++实现）

C++代码

#include <iostream>
using namespace std;
#include <stdio.h>

void Matrixchain(int* p, int n, int** m, int** s) {   //用于求最优值
	//P:一维数组，记录连乘矩阵的行和列；m:输出最优值；s:记录最优断开位置
	int i, j, k, r, t;
	for (i = 1; i <= n; i++)
		for (j = 1; j <= i; j++)m[i][j] = s[i][j] = 0;   //只有一个矩阵时，乘次数为0 

	for (r = 2; r <= n; r++)         //不同规模(2个及2个以上的矩阵相乘）矩阵连乘，规模从2到n的连乘矩阵
		for (i = 1; i <= n - r + 1; i++) {            //每一个规模为r的矩阵连乘序列的首矩阵Ai 
			j = i + r - 1;                           //每一个规模为r的矩阵连乘序列的尾矩阵为Aj
			m[i][j] = m[i + 1][j] + p[i - 1] * p[i] * p[j];    //连乘矩阵断开的方式
			s[i][j] = i;    //记录断开的位置
			for (k = i + 1; k < j; 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;
				}
			}
		}
}

void Traceback(int** s, int i, int j) {   //连乘矩阵的开始编号i和结束编号j
	if (i == j) {      //单个矩阵，不用加括号
		cout << "A" << i; return;
	}
	else
	{
		cout << "(";
		Traceback(s, i, s[i][j]);//递归打印A[i:s[i][j]的加括号方式
		Traceback(s, s[i][j] + 1, j); //递归打印A[s[i][j]+1:j ]的加括号的方式
		cout << ")";

	}
}


int main() {
	int n, i, j;
	int* p, ** m, ** s;
	cout << "请输入连乘矩阵个数n:";
	cin >> n;

	cout << "请输入矩阵的维数矩阵p:" << endl;
	p = new int[n + 1];
	for (i = 0; i <= n; i++)

	{
		if (i == 0)
		{
			cout << "输入A1的行：";
			cin >> p[i];
		}
		else if (i == 1) {
			cout << "输入A1的列：";
			cin >> p[i];
		}
		else   //输入第2个矩阵及之后矩阵的列
		{
			cout << "输入A" << i << "的列：";
			cin >> p[i];
		}

	}

	m = new int* [n], s = new int* [n];
	for (i = 1; i <= n + 1; i++)
	{
		m[i] = new int[n];
		s[i] = new int[n];

	}
	cout << "连乘矩阵最优计算次序是：";
	Matrixchain(p, n, m, s);
	Traceback(s, 1, n);
	cout << endl;

	cout << "次序矩阵s为：" << endl;
	//.....打印j的坐标.........
	cout << "坐标" << '\t';
	for (j = 1; j <= n; j++)
		cout << "j" << j << '\t';
	cout << endl;

	//打印次序矩阵s
	for (i = 1; i <= n; i++)
	{
		cout << "i" << i << '\t';   //打印i的坐标
		for (j = 1; j <= n; j++)
			cout << s[i][j] << '\t';
		cout << endl;
	}
	cout << endl;

	cout << "最优解矩阵m为：" << endl;
	cout << "坐标" << '\t';
	for (j = 1; j <= n; j++)
		cout << "j" << j << '\t';
	cout << endl;

	for (i = 1; i <= n; i++)
	{
		cout << "i" << i << '\t';   //打印i的坐标
		for (j = 1; j <= n; j++)
			cout << m[i][j] << '\t';
		cout << endl;
	}

	return 0;
}