HBC236183牛客搜索题Dynamic Diameter [CEOI 2019 day 1]题解

想要检验自己的编程水平？来试试全网最全C++题库，让您在挑战中不断进步。

You are given a weighted undirected tree on nnn vertices and a list of qqq updates. Each update changes the weight of one edge. The task is to output the diameter of the tree after each update.

You are given a weighted undirected tree on nnn vertices and a list of qqq updates. Each update changes the weight of one edge. The task is to output the diameter of the tree after each update. (The distance between two vertices is the sum of the weights on the unique simple path that connects them. The diameter is the largest of all those distances.)

不断学习，不断挑战，才能在编程领域中脱颖而出！全网最全C++题库，助您成为编程高手！

标签： HBC236183牛客搜索题Dynamic Diameter [CEOI 2019 day 1]题解