#include<stdio.h>
#define maxnum 100000000
long long a[310];
long long m[310][310]={0},s[310][310]={0};
void matrix_chain_order(long long a[],int n);
void paint(int i,int j);
int main()
{
int i,n;
while((scanf("%d",&n))!=EOF)
{
for(i=0;i<=n;i++)
scanf("%lld",&a[i]);
matrix_chain_order(a,n);
printf("%lld\n",m[1][n]);
paint(1,n);
printf("\n");
}
return 0;
}
void matrix_chain_order(long long a[],int n)
{
long long i,l,j,k,q;
for(l=2;l<=n;l++)
for(i=1;i<=n-l+1;i++)
{
j=i+l-1;
m[i][j]=maxnum;
for(k=i;k<=j-1;k++)
{
q=m[i][k]+m[k+1][j]+a[i-1]*a[k]*a[j];
if(q<=m[i][j])
{
m[i][j]=q;
s[i][j]=k;
}
}
}
}
void paint(int i,int j)
{
if(i==j) printf("A%d",i);
else
{
printf("(");
paint(i,s[i][j]);
paint(s[i][j]+1,j);
printf(")");
}
}
矩阵连乘
最新推荐文章于 2023-05-31 21:16:48 发布