2020年4月23日
PAT Advanced 1021 Deepest Root (25分)
摘要： A graph which is connected and acyclic can be considered a tree. The height of the tree depends on the selected root. Now you are supposed to find the 阅读全文
posted @ 2020-04-23 18:46 SteveYu 阅读(107) 评论(0) 推荐(0) 编辑