摘要: Constructing Roads Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20927 Accepted Submission(s): 阅读全文
posted @ 2016-08-23 17:08 猪突猛进!!! 阅读(208) 评论(0) 推荐(0) 编辑
摘要: 大致的步骤 首先选取一个到集合最近的点 然后标记起在集合内部 然后更新最短距离 畅通工程再续 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 24 阅读全文
posted @ 2016-08-23 15:40 猪突猛进!!! 阅读(136) 评论(0) 推荐(0) 编辑
摘要: Problem Description Dandelion's uncle is a boss of a factory. As the spring festival is coming , he wants to distribute rewards to his workers. Now he 阅读全文
posted @ 2016-08-23 09:42 猪突猛进!!! 阅读(151) 评论(0) 推荐(0) 编辑