矩阵连乘问题:
给定n个连乘的矩阵,找出一种加括号的方法,使得矩阵连乘的计算量(乘法次数)最小
矩阵可乘:第一个矩阵的列等于第2矩阵的行时,那么这这两个矩阵是可乘的
多个矩阵相乘的结果矩阵,其行,列分别等于第一个矩阵的行,最后一个矩阵的列;
最优值递归式
m[i][j],当i = j m[i][j] = 0
当i<j时,m[i][j] = min{m[i][k]+m[k+1][i]+p[i-1]*p[k]*p[j]}
int n;
int p[100];
int m[100][100], s[100][100];
void matrixchain()
{
int i, j, r, k;
memset(m, 0, sizeof(m));
memset(s, 0, sizeof(s));
for (r = 2; r <= n; r++)
{
for (i = 1; i <= n - r + 1; i++)
{
j = i + r - 1;
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++)
{
int t = m[i][k] + m[k + 1][j] + p[i - 1] * p[i] * p[j];
if (t < m[i][j])
{
m[i][j] = t;
s[i][j] = k;
}
}
}
}
}
void print(int i,int j)
{
if (i == j)
{
cout << "A[" << i << "]";
return;
}
cout << "(";
print(i, s[i][j]);
print(s[i][j] + 1, j);
cout << ")";
}
int main()
{
cout << "请输入矩阵的个数 n:" << endl;
cin >> n;
int i;
for (i = 0; i <= n; i++)
{
cin >> p[i];
}
matrixchain();
print(1, n);
cout << endl;
cout << "最小计算值为:" << m[1][n] << endl;
system("pause");
return 0;
}