2015年3月9日
A1021. 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 @ 2015-03-09 15:27 Joilee 阅读(141) 评论(0) 推荐(0) 编辑