pat 甲级 1021

1021 Deepest Root （25 分） A graph which is connecte d and acyclic can be considered a tree. The hight of the tree depends on the selected root. Now you are supposed to find the root that results in a h

>>阅读原文<<