问题引入
代码实现
#include<iostream>
using namespace std;
#define N 1000
int matrix_data[N];
int mul_num[N][N],strategy[N][N];
void matrix_mul(int&matrix_num){
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
mul_num[i][j]=0;
strategy[i][j]=0;
}
}
for(int step=2;step<=matrix_num;step++){
for(int i=1;i<=matrix_num-step+1;i++){
int j=i+step-1;
mul_num[i][j]=mul_num[i+1][j]+matrix_data[i-1]*matrix_data[i]*matrix_data[j];
strategy[i][j]=i;
for(int k=i+1;k<j;k++){
int temp_mul=mul_num[i][k]+mul_num[k+1][j]+matrix_data[i-1]*matrix_data[k]*matrix_data[j];
if(temp_mul<mul_num[i][j]){
mul_num[i][j]=temp_mul;
strategy[i][j]=k;
}
}
}
}
}
void print_result(int i,int j){
if(i==j){
cout<<"M["<<i<<"]";
return;
}
cout<<"(";
print_result(i,strategy[i][j]);
cout<<"*";
print_result(strategy[i][j]+1,j);
cout<<")";
}
int main(int argc,char**argv){
cout<<"矩阵个数:\n";
int matrix_num=0;
cin>>matrix_num;
cout<<"矩阵的行数与最后一个矩阵的列数:\n";
for(int i=0;i<=matrix_num;i++){
cin>>matrix_data[i];
}
matrix_mul(matrix_num);
print_result(1,matrix_num);
return 0;
}
程序样例
矩阵个数:
5
矩阵的行数与最后一个矩阵的列数:
3
5
10
8
2
4
((M[1]*(M[2]*(M[3]*M[4])))*M[5])
--------------------------------
Process exited after 11.84 seconds with return value 0
请按任意键继续. . .