2018 年 7月 17 日随笔档案 - yoyo_sincerely

2018年7月17日

摘要： problem A Digital Library contains millions of books, stored according to their titles, authors, key words of their abstracts, publishers, and publish 阅读全文

posted @ 2018-07-17 22:14 yoyo_sincerely 阅读(208) 评论(0) 推荐(0) 编辑

1021 Deepest Root (25)（25 point(s)）

摘要： problem 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 阅读全文

posted @ 2018-07-17 20:09 yoyo_sincerely 阅读(371) 评论(0) 推荐(0) 编辑