2018年4月20日
Codeforces Round #475 (Div. 2) D. Destruction of a Tree
摘要： 1 You are given a tree (a graph with n vertices and n - 1 edges in which it's possible to reach any vertex from any other vertex using only its edges) 阅读全文
posted @ 2018-04-20 20:44 visualVK 阅读(164) 评论(0) 推荐(0) 编辑