2019年7月23日
PAT甲级——A1021 Deepest Root
摘要： 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 @ 2019-07-23 10:51 自由之翼Az 阅读(184) 评论(0) 推荐(0) 编辑