2018年3月17日
浙大pat甲级题目---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 @ 2018-03-17 11:32 有梦想的小菜鸟 阅读(195) 评论(0) 推荐(0) 编辑