最小代价归并树的动态规划实现

Realiziing the Minimum COST Merging Tree with Dynamic Programming

动态规划算法广泛应用于求解最优化问题中.通过对最小代价归并树问题的研究,构造出动态递归方程,分析其最优子结构以及重叠子问题性质,从而实现动态规划的过程分析,并用C程序生成最小代价归并树验证其有效性.

The dynamic programming algorithm is widely used to solve the optimization problems. There constructs the dynamic recurrence equation and analyses its quality including the optimum substruction and the overlapping subproblem through researching the minimum cost merging tree problem ,then realizes the process of the dynamic programming analyze ,and verifies its effectiveness by using C program to output the minimum cost merging tree.