PAT-A1021 Deepest Root 題目內容及題解

A graph which is connected 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 highest tree. Such a root i

>>阅读原文<<