算法标签 dfs,树形DP题目简叙思路每次寻找删除节点之后的剩余联通块最大节点代码#include<iostream>#include<cstring>using
Copyright © 2005-2025 51CTO.COM 版权所有 京ICP证060544号
![[AcWing]846. 树的重心](https://s2.51cto.com/images/blog/202303/20141713_6417fa69b70231391.png?x-oss-process=image/resize,m_fixed,w_116,h_70/ignore-error,1)
