![](https://img-blog.csdnimg.cn/20201014180756738.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM-Kruskal 模板
但求-_-心安
充满鲜花的世界到底在那里,如果他真的存在那么我一定会去。
展开
-
Constructing Roads poj
Description There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are connected, i原创 2016-09-02 11:06:39 · 308 阅读 · 0 评论 -
Kruskal模板题 Slim Span uva
Time Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %llu Submit Status Description Given an undirected weighted graph G , you should find one of spanning原创 2016-09-06 14:45:39 · 392 阅读 · 0 评论