2020年3月4日
PAT 1021 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 @ 2020-03-04 17:55 阳离子 阅读(114) 评论(0) 推荐(0) 编辑