矩阵连乘C语言递归实现

#include "stdio.h"
 int p[100],s[100][100],n;
 //计算最优值
 //递归实现！ 
 int LookupChain(int i, int j)
{
      if (i == j) return 0;
       int u= LookupChain(i,i) + LookupChain(i+1,j) + p[i-1]*p[i]*p[j];
       s[i][j] = i;
       for (int k = i+1; k < j; k++) {
         int t = LookupChain(i,k) + LookupChain(k+1,j) + p[i-1]*p[k]*p[j];
         if (t < u) { u = t; s[i][j] = k;}
         }
       return u;
}
 //构造最优解
void Traceback(int i, int j, int s[100][100]){
		if(i==j) return;
		Traceback(i, s[i][j], s);
		Traceback(s[i][j]+1, j, s);
		printf("Multiply A%d,%d",i,s[i][j]);
		printf("and A%d,%d\n",s[i][j]+1,j);
}
int main(){
    printf("请输入矩阵个数：\n");
    scanf("%d",&n);
    printf("请输入矩阵各维数值：\n");
    for(int i=0;i<n+1;i++){
        scanf("%d",&p[i]);
    }
    printf("最优值为:%d\n",LookupChain(1,n));
	printf("最优解为:\n");
    Traceback(1,n,s);
    printf("\n");
	return 0;
}