算法4.3计算矩阵连乘积的递归算法

#include <stdio.h>

#define NUM 51
int p[NUM];
int m[NUM][NUM];
int s[NUM][NUM];
//在解某个问题的直接递归算法所产生的递归树中，相同的子问题反复出现
int Recurve(int i, int j)
{
	if (i == j) return 0;
	int u = Recurve(i, i)+Recurve(i+1,j) + p[i-1]*p[i]*p[j];
	s[i][j] = i;
	for (int k = i+1; k < j; k++) 
	{
		int t = Recurve(i, k) + Recurve(k+1,j) + p[i-1]*p[k]*p[j];
		if (t < u) { u = t; s[i][j] = k;}
	}
	m[i][j] = u;
	return u;
}

void TraceBack(int i, int j) 
{ 
	if(i==j) printf("A%d", i);
	else 
	{
		printf("(");
		TraceBack(i,s[i][j]); 
		TraceBack(s[i][j]+1,j); 
		printf(")"); 
	}
} 

int main() 
{
	int n;
	scanf("%d", &n);
	int i, temp;
	for (i=0; i<n; i++)
		scanf("%d%d", &p[i], &temp);
	p[n] = temp;
	Recurve(1, n);
	printf("%d\n", m[1][n]);
	TraceBack(1, n);
	return 0;
}
/*Time Limit Exceed*/