摘要:
#include "stdafx.h"#include <iostream>#include <math.h>using namespace std;#define INFINITY 100000000double e[7][6],w[7][6];//5个关键字 i从1--6 j从0--5 int root[6][6];//r表示ki。。kj序列的根void Optimal_BST (const double *p, const double *q,int n){ for (int i=1; i<=n+1; i++) { e[i][i-1] = 阅读全文