#include<iostream>
using namespace std;
void MatrixChainOrder(int p[],int n,int **s,int **m);
void Print(int **a,int i,int j);
int main()
{
int i,n;
cout<<"请输入数组P的大小：";
cin>>n;
int *p=new int[n+1];
cout<<"请输入数组各元素：";
for(i=1;i<=n;i++)
{
cin>>p[i];
}
int **m=new int*[n+1];
for(i=0;i<=n;i++)
{
m[i]=new int[n+1];
memset(m[i],0,sizeof(int)*(n)); //把m[i]赋值为0
}
int **s=new int*[n+1];
for(i=0;i<=n;i++)
{
s[i]=new int[n+1];
memset(s[i],0,sizeof(int)*n);
}
MatrixChainOrder(p,n,s,m);
cout<<"加括号方式为：";
Print(s,1,n);
cout<<endl;
for(i=0;i<n+1;i++) //注意实际申请的空间是 0 ~ n，n+1个
{
delete []m[i];
delete []s[i];
}
delete []m;
delete []s;
return 0;
}
void MatrixChainOrder(int p[],int n,int **s,int **m)
{
int i,j,q;
for(i=1;i<=n;i++)
m[i][i]=0;
for(int l=2;l<=n;l++)
{
for(i=1;i<=n-l+1;i++)
{
j=i+l-1;
m[i][j]=3276722;
for(int k=i;k<=j-1;k++)
{
q=m[i][k]+m[k+1][j]+p[i-1]*p[k]*p[j];
if(q<m[i][j])
{
m[i][j]=q;
s[i][j]=k;
}
}
}
}
}
void Print(int **a,int i,int j)
{
if(i==j)
cout<<"A["<<i<<"]";
else
{
cout<<"(";
Print(a,i,a[i][j]);
Print(a,a[i][j]+1,j);
cout<<")";
}
}
