标签：void tor fat max pre ++ i++ 有根树 span
std::vector<int> tree[maxn]; int fa[maxn]; void dfs(int u,int father) { int len = tree[u].size(); for (int i = 0;i < len;i++) { int v = tree[u][i]; if (v != father) dfs(v,fa[v] = u); } }
标签：void tor fat max pre ++ i++ 有根树 span
原文地址：https://www.cnblogs.com/-Ackerman/p/12228381.html
