摘要： 树形dp 涉及不重复背包组合求最小 从边长分段看不好入手 因为点数只有100点值 include include include include using namespace std; const int N = 205; int vec[N]; struct Edge{ int v, len, 阅读全文