Programming VIP

transport plan Title Link: ybt high efficiency advanced 4-5-5 / luogu P2680 General idea of the topic There is a tree with weights on its edges. Then there are some paths, and then you can choose an edge and make its weight become 0. If you want to make the modified longest given path the shortest, output this value. thinking First, when y ...

Description Xiao A and Xiao B decide to travel during the holiday. They number the cities they want to go from 1 to N, and the smaller cities are in the west of the larger cities. It is known that the altitude of each city is different from each other. Remember that the altitude of city I is \ (h_i \), and the distance between city \ (I \) and ...