摘要: You are given a tree (a connected acyclic undirected graph) of n vertices. Vertices are numbered from 1 to n and each vertex is assigned a character f 阅读全文
posted @ 2018-08-07 11:26 Styx-ferryman 阅读(388) 评论(0) 推荐(0) 编辑