【DFS+思维】codeforces 1092 F. Tree with Maximum Cost

F. Tree with Maximum Cost time limit per test 2 seconds memory limit per test 256 megabytes You are given a tree consisting exactly of nn vertices. Tree is a connected undirected graph with n−1n−1 edg

>>阅读原文<<