ttang

摘要： 算法参考《算法导论》第15章--动态规划//最优二叉查找树#include <cstdio>#include <cstring>#include <limits>class optimalBST{ private: float *p, *q; int n; float **e;//(n+2)*(n+1)//e[1..n+1, 0..n] float **w;//(n+2)*(n+1)//w[1..n+1, 0..n] int **root;//(n+1)*(n+1),0 row and 0 col are not used public: optimalBS 阅读全文