2019年1月25日
PTA (Advanced Level) 1021 Deepest Root
摘要： Deepest Root A graph which is connected and acyclic can be considered a tree. The hight of the tree depends on the selected root. Now you are supposed 阅读全文
posted @ 2019-01-25 15:31 suvvm 阅读(357) 评论(0) 推荐(0) 编辑