小白笔记--------------------矩阵连乘问题（求怎么加括号运算量最小）

#include<stdio.h>
#include<stdlib.h>
#include<math.h>
void print(int(*n)[7]);
void MatrixChain(int*p,int n,int(*m)[7],int(*s)[7]);
main(int argc, char** argv)
{		
	int a1[30][35],a2[35][15],a3[15][5],a4[5][10],a5[10][20],a6[20][25];
	int p[7] = {30,35,15,5,10,20,25};
	int n = 6;
	int m[7][7],s[7][7];//m矩阵表示连乘的运算次数，s表示括号的位置
	MatrixChain(p,n,m,s);
	print(m);
	print(s);
}
void print(int (*n)[7]){
	int i ,j;
	for(i = 0;i < 7;i++){
		for(j = 0;j < 7;j++){
			printf("%d\t",n[i][j]);	
		}
		printf("\n");
	}
}
void MatrixChain(int *p,int n, int (*m)[7],int (*s)[7]){
	int i ,k ,r;
	for(i = 1;i <= n ;i++){
		m[i][i] = 0;
	}
	for(r = 2;r <= n;r++){//r表示矩阵连乘的个数，最小为2
		for(i = 1;i <= n-r+1;i++){//i代表起始位置，j代表最终位置
			int j = i+r-1;
			m[i][j] = m[i+1][j]+p[i-1]*p[i]*p[j];
			s[i][j] = i;
			for(k = i+1;k <j;k++){
				int t = m[i][k]+m[k+1][j]+p[i-1]*p[k]*p[j];
				if(t < m[i][j]){
					m[i][j] = t;
					s[i][j] = k;
				}
			}
		}
	}
}