aha__easy的博客

#include<iostream>#include<vector>using namespace std;void Optimal_BST(vector<double> q,vector<double> p,int n){ vector<vector<double>> e(n+2,vector<double>(n+1)); vector<vector<double>> w(

15.2 动态规划之矩阵链乘法#include<iostream>#include<vector>using namespace std;void matrix_chain_order(vector<int> p){ int n=p.size()-1; vector<vector<int>> m(n+1,vector<int>(n+1)); vector<vector<int>&gt