矩阵相乘最优解

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

int m[101] = {30,35,15,5,10,20};
int fx[101][100];//
int num = 5;

int main() {
	for (int i = 0; i <num+1; i++) {
		fx[1][i] = 0;
	}
	for (int i = 2; i <= num; i++) {//阶数
		for (int j = 0; j <= num - i; j++) {//序号
			int min = 0x7fffffff;
			for (int k = 1; k < i; k++) {//后一个阶数
				if (fx[i - k][j] + fx[k][j + i - k]+m[j]*m[j+i-k]*m[j+i] < min) {
					min = fx[i - k][j] + fx[k][j + i - k] + m[j] * m[j + i - k] * m[j + i];
					fx[i][j] = min;
				}

			}
		}
		for (int j = 0; j <= num - i; j++) {
			cout << fx[i][j]<< " ";
		}
		cout << endl;
	}
	cout << fx[num][0];
	return 0;
}