An Interesting tree problem

Revision en1, by Chenghiz, 2017-04-14 00:41:28

I have been given a weighed undirected tree. For each subtree of this tree, I need to find the node from which the sum of distances to all other nodes in the subtree is minimum.

The no. of nodes in the tree is of the order of 10^5.

Tags tree, interesting, hard

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English Chenghiz 2017-04-14 00:41:28 262 Initial revision (published)