Update count-subtrees-with-max-distance-between-cities.py

Author: kamyu104

Python/count-subtrees-with-max-distance-between-cities.py

@@ -29,7 +29,7 @@ def dfs(n, adj, curr, parent, lookup, count, dp):
                             for child_max_d in xrange(child_d, min(2*child_d+1, count[child])):
                                 new_dp_curr[max(curr_d, child_d+1)][max(curr_max_d, child_max_d, curr_d+child_d+1)] += \
                                     dp[curr][curr_d][curr_max_d]*dp[child][child_d][child_max_d]  # count subtrees with new child
-                count[curr] += count[child]  # merge child to count subtrees
+                count[curr] += count[child]  # merge new child
                 dp[curr] = new_dp_curr
 
         adj = collections.defaultdict(list)