对于给定的n个矩阵形成的矩阵链M1,M2,M3,…,Mn,求计算乘积M1M2M3…Mn时进行最少次标量相乘的运算顺序,这类问题就称为矩阵链乘法问题(Matrix Chain Multiplication Problem)
//O(n的三次方)
#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 100;
int main()
{
int n,p[maxn+1],m[maxn+1][maxn+1];
cin>>n;
for(int i = 1;i <= n;++i)cin >> p[i-1] >> p[i];
for(int i = 1;i <= n;++i)m[i][i] = 0;
for(int L = 2;L <= n;++L)//L 为 相乘矩阵的数量
{
for(int i = 1;i <= n - L + 1;++i)//n - L + 1为相乘矩阵数量为 L的 组合有多少种。注意不能调换相乘顺序,只能结合
{
int j = i + L - 1;
m[i][j] = (1<<21);
for(int k = i;k <= j - 1;++k)
{
m[i][j] = min(m[i][j],m[i][k] + m[k+1][j] + p[i-1] * p[k] * p[j]);
}
}
}
cout<<m[1][n]<<endl;
return 0;
}