P1967 Lorry transport
- Well, I'm going to write my ideas first, qwq.
- Obviously for each truck passing through the path, the edge of the smallest side of the larger, the answer is better--first to ask for a maximum spanning tree to ensure that the Bingban value on the tree as large as possible
- Because the maximum spanning tree is found, the path between the two points is unique----the method of calculating LCA can be obtained by multiplication to find the transportation path of the wagon, and update the minimum value of the upper right of the path is the answer QWQ
- It is possible that two points are not connected, and look for their father Qwq, output "1"
- Now, there's a little problem. Qaq, how to update the minimum value of the edge when multiplying ah ah ah ah ah Qaq
- Now we're going to eat, come back and take off! biu~~~//11.43
"Noip Series--Graph theory" Freight transport
