摘要:题意: 给出一棵$n$个节点的树和$m$条链,每条链有一个权值。 从中选出若干条链,两两不相交,并且使得权值之和最大。 分析: "题解" cpp include include include include include include include include using namespa 阅读全文
posted @ 2017-06-06 23:38 AOQNRMGYXLMV 阅读 (126) 评论 (0) 编辑