矩阵链乘法

#include 

#define maxint 99999

int p[100],m[100][100],s[100][100];

int n;

void find(int i,int j){

if(i==j)

printf("A%d",i);

else{

int k=s[i][j];

printf("(");

find(i,k);

find(k+1,j);

printf(")");

}

}

int main(){

int i,j,k,l;

while(scanf("%d",&n)!=EOF){

for(i=0;i<=n;i++){

scanf("%d",&p[i]);

m[i][i]=0;

}

for(l=2;l<=n;l++){

for(i=1;i<=n-l+1;i++){

j=i+l-1;

m[i][j]=maxint;

for(k=i;k

if(m[i][j]>(m[i][k]+m[k+1][j]+p[i-1]*p[k]*p[j])){

m[i][j]=m[i][k]+m[k+1][j]+p[i-1]*p[k]*p[j];

s[i][j]=k;

}

}

}

}

       find(1,n);

printf("\n");

}

return 0;

}