生成树
文章平均质量分 83
Twenty_seven
这个作者很懒,什么都没留下…
展开
-
poj2377 最小生成树
如题:http://poj.org/problem?id=2377Bad CowtractorsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11056 Accepted: 4661DescriptionBessie has been hired to原创 2015-03-04 10:52:01 · 348 阅读 · 0 评论 -
poj2395 最小生成树
如题:http://poj.org/problem?id=2395Out of HayTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11734 Accepted: 4598DescriptionThe cows have run out of hay,原创 2015-03-04 10:47:55 · 319 阅读 · 0 评论 -
poj1258
如题:http://poj.org/problem?id=1258Agri-NetTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 42375 Accepted: 17317DescriptionFarmer John has been elected ma原创 2015-03-03 22:22:11 · 367 阅读 · 0 评论 -
poj3723 kruskal
如题:http://poj.org/problem?id=3723 ConscriptionTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8418 Accepted: 2930DescriptionWindy has a country, a原创 2015-02-19 22:18:13 · 379 阅读 · 0 评论 -
poj1258 prim
#includeusing namespace std;#define MAX 101#define MAXCOST 0x7fffffffint graph[MAX][MAX];int prim(int g[MAX][MAX],int n){ int i,j; int lowcost[MAX]; int visited[MAX]; int minid,sum原创 2014-11-08 09:19:35 · 503 阅读 · 0 评论 -
poj 1251
如题:http://poj.org/problem?id=1251 求最小生成树的原创 2014-11-05 20:09:14 · 836 阅读 · 0 评论 -
蓝桥安慰奶牛
如题:http://lx.lanqiao.org/problem.page?gpid=T16问题描述Farmer John变得非常懒,他不想再继续维护供奶牛之间供通行的道路。道路被用来连接N个牧场,牧场被连续地编号为1到N。每一个牧场都是一个奶牛的家。FJ计划除去P条道路中尽可能多的道路,但是还要保持牧场之间 的连通性。你首先要决定那些道路是需要保留的N-1条道路。第j条双向道路连接了原创 2015-04-10 20:34:12 · 332 阅读 · 0 评论 -
poj2377 kruskal
如题:http://poj.org/problem?id=2377Bad CowtractorsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11956 Accepted: 4968DescriptionBessie has been hired t原创 2015-08-10 12:08:24 · 326 阅读 · 0 评论 -
poj2395 kruskal
如题:http://poj.org/problem?id=2395Out of HayTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12953 Accepted: 5050DescriptionThe cows have run out of hay,原创 2015-08-10 12:20:09 · 309 阅读 · 0 评论