MST算法就是最小生成树算法！ 在ACM中这个应该是比较简单的一个算法！ 大家好好学习吧！ -MST algorithm is the minimum spanning tree algorithm! In ACM in this should be a relatively simple algorithm! We can learn from it!

PKU1655解题报告 动态规划算法、dp算法、ACM题-PKU1655 dynamic programming algorithm for solving the report, dp algorithm, ACM title