C++矩阵相乘

#include<iostream>
#include<string>
using namespace std;


/*void MatrixChain(int *p, int n, int **min_part, int **min_point){
for(int i = 0; i < n; i++){
min_part[i][i] = 0;
}
for(int num = 2; num <= n; num++){
for(int i = 0; i < n-num+1; i++){
int j = num+i-1;
min_part[i][j] = p[i]*p[i+1]*p[j+1] + min_part[i+1][j];
min_point[i][j] = i;
for(int k = i+1; k < j; k++){
int temp = min_part[i][k] + min_part[k+1][j] + p[i]*p[k+1]*p[j+1];
if(temp < min_part[i][j]){
min_part[i][j] = temp;
min_point[i][j] = k;
}
}
}
}
}
void printfChain(int i, int j, char **a,int **min_point){
if(i == j){
printf("%s",a[i]);
}
else{
printf("(");
printfChain(i,min_point[i][j],a,min_point);
printfChain(min_point[i][j]+1,j,a,min_point);
printf(")");
}
}


int main(){
int p[7] = {30,35,15,5,10,20,25};
int **min_part,**min_point;
int n = 6;
char **a;
a = (char**)malloc(sizeof(char*)*n);
min_part = (int**)malloc(sizeof(int*)*n);
min_point = (int**)malloc(sizeof(int*)*n);


for(int i = 0; i < n; i++){
min_part[i] = (int*)malloc(sizeof(int)*n);
min_point[i] = (int*)malloc(sizeof(int)*n);
a[i] = (char*)malloc(sizeof(char)*n);
}


a[0] = "A1";
    a[1] = "A2";
    a[2] = "A3";
    a[3] = "A4";
    a[4] = "A5";
    a[5] = "A6";
MatrixChain(p,n,min_part,min_point);
int ret = min_part[0][n-1];

printf("%d\n",ret);
printfChain(0,n-1,a,min_point);
system("pause");
return 0;
}*/




void matrixChain(int *p, int n, int **min_part, int **min_point){
for(int i=0; i < n; i++){
min_part[i][i] = 0;
}
for(int num = 2; num <= n; num++){
for(int i = 0; i <= n - num; i++){
int j = i + num -1;
min_part[i][j] = p[i]*p[i+1]*p[j+1] + min_part[i+1][j];
min_point[i][j] = i;
for(int k = i; k < j; k++){
int temp = min_part[i][k] + min_part[k+1][j] + p[i]*p[k+1]*p[j+1];
if(temp < min_part[i][j]){
min_part[i][j] = temp;
min_point[i][j] = k;
}
}
}
}
}


/*int reMatrixChain(int *p, int i, int j, int **min_part, int **min_point){
if(i == j) return 0;
else{
min_part[i][j] = reMatrixChain(p,i,i,min_part,min_point) + reMatrixChain(p,i+1,j,min_part,min_point) + p[i]*p[i+1]*p[j+1];
min_point[i][j] = i;
for(int k = i; k < j; k++){
int temp = reMatrixChain(p,i,k,min_part,min_point) + reMatrixChain(p,k+1,j,min_part,min_point) + p[i]*p[k+1]*p[j+1];
if(temp < min_part[i][j]){
min_part[i][j] = temp;
min_point[i][j] = k;
}
}
}
return min_part[i][j];
}*/
int reMatrixChain(int *p,int i,int j,int **min_part,int **min_point){
if(i == j)return 0;
else{
min_part[i][j] = reMatrixChain(p,i,i,min_part,min_point) + reMatrixChain(p,i+1,j,min_part,min_point) + p[i]*p[i+1]*p[j+1];
min_point[i][j] = i;
for(int k = i; k < j; k++){
int temp = reMatrixChain(p,i,k,min_part,min_point) + reMatrixChain(p,k+1,j,min_part,min_point) + p[i]*p[k+1]*p[j+1];
if(temp < min_part[i][j]){
min_part[i][j] = temp;
min_point[i][j] = k;
}
}
return min_part[i][j];
}

}
int lookUpChain(int *p, int i,int j,int **min_part,int **min_point){
if(min_part[i][j] > 0) return min_part[i][j];
if(i == j) return 0;
min_part[i][j] = lookUpChain(p,i,i,min_part,min_point) + lookUpChain(p,i+1,j,min_part,min_point) + p[i]*p[i+1]*p[j+1];
min_point[i][j] = i;
for(int k = i; k < j; k++){
int temp = lookUpChain(p,i,k,min_part,min_point) + lookUpChain(p,k+1,j,min_part,min_point) + p[i]*p[k+1]*p[j+1];
if(temp < min_part[i][j]){
min_part[i][j] = temp;
min_point[i][j] = k;
}
}
return min_part[i][j];
}
int memMatrixChain(int *p, int n, int i, int j, int **min_part, int **min_point){
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
min_part[i][j] = 0;
}
}
return lookUpChain(p,i,j,min_part,min_point);
}
void printfChain(int i, int j, char *a, int **min_point){
if(i == j){
printf("%c",a[i]);
}
else{
printf("(");
printfChain(i,min_point[i][j],a,min_point);
printfChain(min_point[i][j]+1,j,a,min_point);
printf(")");
}
}
int main(){
int p[7] = {30,35,15,5,10,20,25};
char a[6] = {'a','b','c','d','e','f'};
int **min_part,**min_point;
int n = 6;
min_part = (int **)malloc(sizeof(int*)*n);
min_point = (int **)malloc(sizeof(int*)*n);


for(int i = 0; i < n; i++){
min_part[i] = (int *)malloc(sizeof(int)*n);
min_point[i] = (int *)malloc(sizeof(int)*n);
}
//matrixChain(p,6,min_part,min_point);
//int ret = reMatrixChain(p,0,5,min_part,min_point);
//int ret = min_part[0][n-1];
int ret = memMatrixChain(p,6,0,5,min_part,min_point);
printf("%d\n",ret);
printfChain(0,n-1,a,min_point);
system("pause");
return 0;
}