摘要: 题面 Vasya has a tree consisting of n vertices with root in vertex 1. At first all vertices has 0 written on it. Let d(i,j) be the distance between vert 阅读全文
posted @ 2019-09-06 13:18 断腿三郎 阅读(187) 评论(0) 推荐(0) 编辑