问题描述:
计算n个矩阵的乘积:
M = M1 * M2 * M3 * .............Mn
在乘积的过程中,由于结合律,不同的顺序下所需要的算术运算次数有很大影响。如何找到乘法次数最少的方法,并且输出方案。
这是一类标准的动态规划问题,我们可以通过构造dp自底向上地得到最终答案。
假设有4个矩阵,mxn分别为35*40, 40*20, 20*10, 10*15。
int main()
{
int rows=4;
int cols=4;
int r[5] = { 35,40,20,10,15 };
int** data = new int* [rows];
for (int i = 0; i < rows; ++i)
{
data[i] = new int[cols];
}
for (int i = 0; i < rows; i++)
{
for (int j = 0; j < cols; j++)
{
data[i][j] = 0;
}
}
int n = 4;
int level = 1;
for (; level <=n; level++)
{
//cout << "level = " << level << endl;
for (int i = 0; i < n - level; i++)
{
int j = i + level;
data[i][j] = INT_MAX;
//cout << " i=" << i << ", j =" << j << endl;
for (int k = i; k <= j-1; ++k)
{
int tmp = data[i][k] + r[i] * r[k + 1] * r[j + 1] + data[k+1][j];
//cout << " tmp " << tmp << endl;
if (data[i][j] > tmp)
{
data[i][j] = tmp;
//cout << " i=" << i << ", j =" << j << ", data = " << data[i][j] << endl;
}
}
//cout << "++++++++++++++++++++++++ data[i][j] =" << data[i][j] << endl;
}
}
cout << data[0][3];
}
思考:
这类问题主要是动态二维数据初始化以及状态转移方程上面存在难点,此外,如何进行结果的回溯也是值得考虑的。