'commit'

TangDou/Topic/HuanGenDp/CF1324F.cpp

@@ -8,18 +8,21 @@ void add(int a, int b, int c = 0) {
     e[idx] = b, ne[idx] = h[a], w[idx] = c, h[a] = idx++;
 }
 
-int dp[N], f[N], vis[N], c[N];
+int f1[N];
-int n;
+int f2[N];
+int vis[N];
+int c[N]; // 颜色
+int n;    // 节点数量
 
 void dfs1(int u, int fa) {
-    dp[u] = c[u];
+    f1[u] = c[u];
     for (int i = h[u]; ~i; i = ne[i]) {
         int v = e[i];
         if (v == fa) continue;
         dfs1(v, u);
-        if (dp[v] > 0) {
+        if (f1[v] > 0) {
             vis[v] = 1;
-            dp[u] += dp[v];
+            f1[u] += f1[v];
         }
     }
 }
@@ -28,8 +31,8 @@ void dfs2(int u, int fa) {
     for (int i = h[u]; ~i; i = ne[i]) {
         int v = e[i];
         if (v == fa) continue;
-        int val = f[u] - (vis[v] ? dp[v] : 0);
+        int val = f2[u] - (vis[v] ? f1[v] : 0);
-        f[v] = dp[v] + (val > 0 ? val : 0);
+        f2[v] = f1[v] + (val > 0 ? val : 0);
         dfs2(v, u);
     }
 }
@@ -52,9 +55,9 @@ int main() {
     }
 
     dfs1(1, 0);
-    f[1] = dp[1];
+    f2[1] = f1[1];
     dfs2(1, 0);
 
-    for (int i = 1; i <= n; i++) printf("%d ", f[i]);
+    for (int i = 1; i <= n; i++) printf("%d ", f2[i]);
     return 0;
 }