2021年3月7日
2020 BIT冬训-图&&DFS&&BFS O - Hamiltonian Spanning Tree CodeForces - 618D （点的度数，树的最小路径覆盖cy）
摘要： Problem Description A group of n cities is connected by a network of roads. There is an undirected road between every pair of cities, so there are roa 阅读全文
posted @ 2021-03-07 21:12 mikku 阅读(68) 评论(0) 推荐(0)