![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
topcoder
文章平均质量分 77
acerlawson
这个作者很懒,什么都没留下…
展开
-
Topcoder SRM642 TaroCutting
Problem Statement Cat Taro has some trees in his garden. Initially, the i-th tree (0-based index) is height[i] meters tall. Each day the trees grow. For each i, the i-th tree will grow by原创 2014-12-17 21:01:47 · 381 阅读 · 0 评论 -
Topcoder SRM661 ColorfulLineGraphs
Problem Statement Bob is going to create a graph with N nodes. The graph will be constructed in two steps. First, Bob will take N isolated vertices, label them 1 through N and color each o原创 2015-06-15 00:17:26 · 440 阅读 · 0 评论