矩阵乘法最少次数【动态规划（递归/非递归）】

#include<iostream>
using namespace std;
int P[1001],m[1001][1001],s[1001][1001];
void Initial(int &n){
	cin>>n;
	for(int i = 0;i <= n;i++)cin>>P[i];
	for(int i = 1;i <= n;i++)
	for(int j = 1;j <= n;j++){
		s[i][j] = 0;
		m[i][j] = 0;
	}
}
void MatrixChain(int n){
	for(int len = 2;len <= n;len++){
		for(int i = 1;i <= n;i++){
			int j = i + len - 1;
			m[i][j] = m[i][i] + m[i + 1][j] + (P[i - 1] * P[i] * P[j]);
			s[i][j] = i;
			for(int k = i + 1;k < j;k++){
				int val = m[i][k] + m[k + 1][j] + (P[i - 1] * P[k] * P[j]);
				if(m[i][j] > val){
					m[i][j] = val;
					s[i][j] = k;
				}
			}
		} 
	}
}
int RecursionMatrixChain(int top,int tail){
	if(m[top][tail] != 0 || top == tail)return m[top][tail];
	else{
		m[top][tail] = RecursionMatrixCha