'commit'

TangDou/Topic/HuanGenDp/CF1187E.cpp

@@ -1,49 +1,55 @@
 #include <bits/stdc++.h>
 using namespace std;
-const int N = 200010;
+const int N = 200010, M = N << 1;
 #define int long long
 #define endl "\n"
 
-vector<int> son[N];
+// 链式前向星
-int vis[N], n;
+int e[M], h[N], idx, w[M], ne[M];
+void add(int a, int b, int c = 0) {
+    e[idx] = b, ne[idx] = h[a], w[idx] = c, h[a] = idx++;
+}
+
+int n;
 int sz[N];
 int f[N];
-void dfs(int u) {
+void dfs(int u, int fa) {
     sz[u] = 1;
-    vis[u] = 1;
+
-    for (int i = 0; i < son[u].size(); i++) {
+    for (int i = h[u]; ~i; i = ne[i]) {
-        int v = son[u][i];
+        int v = e[i];
-        if (!vis[v]) {
+        if (v != fa) {
-            dfs(v);
+            dfs(v, u);
             sz[u] += sz[v];
         }
     }
 }
-void dp(int u) {
+void dp(int u, int fa) {
-    vis[u] = 1;
+    for (int i = h[u]; ~i; i = ne[i]) {
-    for (int i = 0; i < son[u].size(); i++) {
+        int v = e[i];
-        int v = son[u][i];
+        if (v != fa) {
-        if (!vis[v]) {
             f[v] = f[u] + sz[1] - 2 * sz[v];
-            dp(v);
+            dp(v, u);
         }
     }
 }
 
 signed main() {
+    // 初始化链式前向星
+    memset(h, -1, sizeof h);
+
     cin >> n;
     for (int i = 1; i < n; i++) {
-        int u, v;
+        int a, b;
-        cin >> u >> v;
+        cin >> a >> b;
-        son[u].push_back(v);
+        add(a, b), add(b, a);
-        son[v].push_back(u);
     }
-    dfs(1);
+
+    dfs(1, 0);
 
     for (int i = 1; i <= n; i++) f[1] += sz[i];
 
-    memset(vis, 0, sizeof(vis));
+    dp(1, 0);
-    dp(1);
 
     int ans = -0x3f;
     for (int i = 1; i <= n; i++) ans = max(ans, f[i]);