Codeforces Round #527 (Div. 3) Tree with Maximum Cost

You are given a tree consisting exactly of nn vertices. Tree is a connected undirected graph with n−1n−1 edges. Each vertex vv of this tree has a value avavassigned to it. Let dist(x,y)dist(x,y) be th

>>阅读原文<<