C题前示链向星 #include <bits/stdc++.h> using namespace std; int fa[200005], siz[200005], vis[200005], f[200005]; vector<int> e[200005], le; struct edge { int sz, sum; } a[200005]; int len = 0; int cmp(edge x, edge y) { return x.sum < y.sum; } int main() { long long n; cin &g...