'commit'

TangDou/Topic/HuanGenDp/P3478.cpp

@@ -1,49 +1,53 @@
 #include <bits/stdc++.h>
 using namespace std;
-const int N = 1000010;
+const int N = 1000010, M = N << 1;
 #define int long long
 #define endl "\n"
 
-struct edge {
+int n, id;
-    int to, nxt;
+// 链式前向星
-} e[N << 1];
+int e[M], h[N], idx, w[M], ne[M];
-int n, cnt, id;
+void add(int a, int b, int c = 0) {
-int head[N];
+    e[idx] = b, ne[idx] = h[a], w[idx] = c, h[a] = idx++;
+}
+
 int ans;
 int f[N], dep[N], size[N];
-inline void add(int u, int v) {
+
-    e[++cnt].nxt = head[u];
+void dfs1(int u, int fa) {
-    head[u] = cnt;
+    size[u] = 1;
-    e[cnt].to = v;
+    dep[u] = dep[fa] + 1;
-}
+    for (int i = h[u]; ~i; i = ne[i]) {
-void dfs1(int x, int fa) {
+        int v = e[i];
-    size[x] = 1;
+        if (v == fa) continue;
-    dep[x] = dep[fa] + 1;
+        dfs1(v, u);
-    for (int i = head[x]; i; i = e[i].nxt) {
+        size[u] += size[v];
-        int y = e[i].to;
-        if (y == fa) continue;
-        dfs1(y, x);
-        size[x] += size[y];
     }
 }
-void dfs2(int x, int fa) {
+void dfs2(int u, int fa) {
-    for (int i = head[x]; i; i = e[i].nxt) {
+    for (int i = h[u]; ~i; i = ne[i]) {
-        int y = e[i].to;
+        int v = e[i];
-        if (y == fa) continue;
+        if (v == fa) continue;
-        f[y] = f[x] + n - 2 * size[y];
+        f[v] = f[u] + n - 2 * size[v];
-        dfs2(y, x);
+        dfs2(v, u);
     }
 }
 signed main() {
+    memset(h, -1, sizeof h);
     cin >> n;
-    for (int i = 1; i < n; i++) {
+    for (int i = 1; i < n; i++) { // n-1条边
-        int u, v;
+        int a, b;
-        cin >> u >> v;
+        cin >> a >> b;
-        add(u, v), add(v, u);
+        add(a, b), add(b, a); // 换根DP，无向图
     }
+    // 1、第一次dfs,找出：xxx
     dfs1(1, 0);
+
+    // 2、换根
     for (int i = 1; i <= n; i++) f[1] += dep[i];
     dfs2(1, 0);
+
+    // 3、找答案
     for (int i = 1; i <= n; i++)
         if (ans < f[i]) ans = f[i], id = i;
     cout << id << endl;