随笔分类 -  MST

poj 3625 （最小生成树算法）
摘要：Building RoadsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12203 Accepted: 3448DescriptionFarmer John had just acquired s... 阅读全文
posted @ 2018-05-10 23:10 erge1998 阅读(170) 评论(0) 推荐(0)
POJ 3723 征兵问题（最小生成树算法的应用）
摘要：ConscriptionTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15923 Accepted: 5510DescriptionWindy has a country, and he wants... 阅读全文
posted @ 2018-05-01 22:50 erge1998 阅读(201) 评论(0) 推荐(0)
最小生成树问题：kruskal算法
摘要：struct edge(int u,v,cost;};bool comp(const edge& e1,const edge& e2){ return e1.cost<e2.cost;}edge es[MAX_E];int V,E;//下面是自定义好的并查集的实... 阅读全文
posted @ 2018-05-01 22:14 erge1998 阅读(269) 评论(0) 推荐(0)