摘要: Description You are given a tree (an acyclic undirected connected graph) with n nodes. The tree nodes are numbered from 1 to n. Each node has a color, 阅读全文
posted @ 2016-02-29 20:55 chenyushuo 阅读(785) 评论(0) 推荐(0) 编辑
摘要: Description You are given a tree (an acyclic undirected connected graph) with n nodes. The tree nodes are numbered from 1 to n. Each node has a color, 阅读全文
posted @ 2016-02-29 20:52 chenyushuo 阅读(1190) 评论(0) 推荐(0) 编辑