2020年7月26日
牛客网Graph
摘要： 题目描述： Mr. W got a new graph with N vertices and N - 1 edges. It's a connected graph without cycles. Each edge should have an ugly value. To make the g 阅读全文
posted @ 2020-07-26 15:27 mdID（WWWZZZQQQ） 阅读(253) 评论(0) 推荐(0)
牛客网Portal
摘要： 题目描述： You are now in a big factory. The factory could be recognized as a graph with n vertices and m edges. Every edge has its length. You have k miss 阅读全文
posted @ 2020-07-26 14:08 mdID（WWWZZZQQQ） 阅读(314) 评论(0) 推荐(0)