摘要:
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
阅读(798)
评论(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
阅读(1207)
评论(0)
推荐(0)

浙公网安备 33010602011771号