摘要: http://bestcoder.hdu.edu.cn/contests/contest_chineseproblem.php?cid=654&pid=1004#include#define REP(i,a,b) for(int i=a;i G[maxn];ll dfs(int u,int x){ ... 阅读全文
posted @ 2015-12-06 00:14 __560 阅读(214) 评论(0) 推荐(0) 编辑