文件名称:substr
介绍说明－－下载内容均来自于网络，请自行研究使用
给定1 棵有n 个结点的树T。子树分割问题要求从树T 中删除尽可能少的边得到一个恰有k 个结点的连通分支。
-There is a given n nodes of the tree T. Subtree the division of T from the tree to remove as far as possible, get a little edge there are exactly k nodes branch connectivity.
-There is a given n nodes of the tree T. Subtree the division of T from the tree to remove as far as possible, get a little edge there are exactly k nodes branch connectivity.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
substr.cpp