acm_搜索
xxtz_xt
wa到怀疑人生
展开
-
CodeForces - 734E Anton and Tree(树的直径)
点击打开链接 Anton is growing a tree in his garden. In case you forgot, the tree is a connected acyclic undirected graph. There are n vertices in the tree, each of them is painted black or white. Anto原创 2017-08-16 19:08:16 · 230 阅读 · 0 评论 -
codeforces839C Journey(DFS)
点击打开链接 C. Journey time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output There are n cities and n - 1 roads原创 2017-08-16 19:31:48 · 237 阅读 · 0 评论