摘要：树的直径 树的直径有两种求法 1.两遍 dfs 法, 便于输出具体方案,但是无法处理负权边 2.DP 法,代码量少,可以处理负权边 cpp include include include include include include using namespace std; const int M 阅读全文

摘要：树的直径 树的直径求法： 1. 任取一点u，找到树上距u最远的点s 2. 找到树上距s点最远的点t，s t的距离即为所求 cpp include include include include include include include using namespace std; int init 阅读全文