摘要: 树形dp#include #include using namespace std;#define D(x) const int INF = 0x3f3f3f3f;const int MAX_N = (int)(2e5) + 10;int n;vector > edge[MAX_N];int re_... 阅读全文
posted @ 2015-04-04 19:59 金海峰 阅读(608) 评论(0) 推荐(0) 编辑