动态规划

/*
Matrix-chain product. The following are some instances.
<30,35,15,5,10,20,25>
<3, 5, 2, 1,10>
<2, 7, 3, 6, 10>
<10, 3, 15, 12, 7, 2>
<7, 2, 4, 15, 20, 5>
*/
# include <iostream>
using namespace std;

#define MAX 100000000;
void matrix_chain_order(int p[],int n);
void print_optimal_parens(int i,int j);

int m[20][20];//i->j的最小代价
int s[20][20];//m[i][j]分割点k
int main()
{
	int len,n;//len是p[]的长度，n是矩阵的长度
	int *p;
	//处理p[]的输入
	cout<<"input the length of p[]:";
	cin>>len;
	cout<<"input the p[]:"<<endl;
	n = len - 1;
	p = new int[len];
	for(int i=0;i<len;i++)
		cin>>p[i];
	for(i=0;i<len;i++)
		cout<<p[i]<<" ";
	cout<<endl;
	//求出最小代价
	matrix_chain_order(p,n);
	cout<<"最小代价："<<m[1][n]<<endl;
	//构造最优解
	cout<<"构造最优解："<<endl;
	print_optimal_parens(1,n);
	cout<<endl;
	return 0;
}

void matrix_chain_order(int p[],int n)
{
	for(int i=1;i<n;i++)
		m[i][i] = 0;
	for(int l=2;l<=n;l++)
		for(int i=1;i<=n-l+1;i++)
		{
			int j = i+l-1;
			m[i][j] = MAX;
			for(int k=i;k<j;k++)
			{
				int 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_optimal_parens(int i,int j)
{
	if(i == j)
		cout<<"A"<<i;
	else
	{
		cout<<"(";
		int k = s[i][j];
		print_optimal_parens(i,k);
		print_optimal_parens(k+1,j);
		cout<<")";
	}
}