计算矩阵链乘法括号化方案的程序

这是个时间复杂度为n^3, 空间复杂度为n^2的DP

具体思路见算法导论P211

#include<algorithm>
#include <iostream>
#include  <sstream>
#include  <cstring>
#include  <cstdlib>
#include   <string>
#include   <vector>
#include   <cstdio>
#include   <math.h>
#include    <queue>
#include    <stack>
#include      <set>
#include      <map>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define rep(i,a,n) for (int i = a; i < n; ++i)
#define per(i,a,n) for (int i = n-1; i >= a; --i)
#define SZ(x) ((int)x.size())
using namespace std;
//head
constexpr int maxn = 1e4;
vector<int> p;//矩阵A的大小为p[i - 1] * p[i]
vector<vector<int> > m, s; //m[i][j]代表计算矩阵A[i][j]所需标量乘法次数的最小值，s[i][j]记录最优值m[i][j]对应的分割点
int MATRIX_CHAIN_ORDER(vector<int> p)
{
	int n = p.max_size() - 1;
	rep(i, 1, n + 1) m[i][i] = 0;
	rep