'commit'

TangDou/Topic/HuanGenDp/P6419.cpp

@@ -12,7 +12,7 @@ void add(int a, int b, int c = 0) {
 }
 
 int pos[N];
-int sz[N], g[N], f[N];
+int sz[N], f[N], g[N];
 int len[N], id[N], slen[N];
 
 void dfs1(int u, int fa) {
@@ -22,7 +22,7 @@ void dfs1(int u, int fa) {
         if (v == fa) continue;
         dfs1(v, u);
         if (sz[v]) {
-            g[u] += g[v] + 2 * w[i];
+            f[u] += f[v] + 2 * w[i];
             int now = len[v] + w[i];
             if (now >= len[u])
                 slen[u] = len[u], len[u] = now, id[u] = v;
@@ -38,9 +38,9 @@ void dfs2(int u, int fa) {
         int v = e[i];
         if (v == fa) continue;
         if (!sz[v])
-            f[v] = f[u] + 2 * w[i], len[v] = len[u] + w[i];
+            g[v] = g[u] + 2 * w[i], len[v] = len[u] + w[i];
         else if (m - sz[v]) {
-            f[v] = f[u];
+            g[v] = g[u];
             if (id[u] != v && len[v] < len[u] + w[i])
                 slen[v] = len[v], len[v] = len[u] + w[i], id[v] = u;
             else if (len[v] < slen[u] + w[i])
@@ -50,7 +50,7 @@ void dfs2(int u, int fa) {
             else if (slen[v] < slen[u] + w[i])
                 slen[v] = slen[u] + w[i];
         } else
-            f[v] = g[v];
+            g[v] = f[v];
         dfs2(v, u);
     }
 }
@@ -70,8 +70,8 @@ signed main() {
         pos[x] = 1;
     }
     dfs1(1, 0);
-    f[1] = g[1];
+    g[1] = f[1];
 
     dfs2(1, 0);
-    for (int i = 1; i <= n; i++) cout << f[i] - len[i] << endl;
+    for (int i = 1; i <= n; i++) cout << g[i] - len[i] << endl;
 }