2013年8月13日
poj 3522 Slim Span (最小生成树kruskal)
摘要： http://poj.org/problem?id=3522Slim SpanTime Limit:5000MSMemory Limit:65536KTotal Submissions:5666Accepted:2965DescriptionGiven an undirected weighted graphG, you should find one of spanning trees specified as follows.The graphGis an ordered pair (V,E), whereVis a set of vertices {v1,v2, …,vn} andEis 阅读全文
posted @ 2013-08-13 10:48 crazy_apple 阅读(417) 评论(0) 推荐(0)