liubaoli1989的专栏

//15.5最优二叉查找树 # include using namespace std; #define N 5 double e[N+2][N+2]={0},w[N+2][N+2]={0}; int root[N+2][N+2]={0}; void Optimal_Bst(double p[],double q[],int n)// { int i,j,l,r; double t; f

/* //递归贪心算法求解活动选择问题 #include using namespace std; #define N 11 int s[N+1]={0,1,3,0,5,3,5,6,8,8,2,12}; int f[N+1]={0,4,5,6,7,8,9,10,11,12,13,14}; int a[N+1]; void Recursive_Activity_Selector(int s[