次小生成树
oopslb
这个作者很懒,什么都没留下…
展开
-
UVa 10462 Is There A Second Way Left?
Is There A Second Way Left ?Input: standard inputOutput: standard outputTime Limit: 3 seconds Nasa, being the most talented programmer of his time, can‘t think things to be so simp原创 2018-01-27 20:32:18 · 180 阅读 · 0 评论 -
hdu4081
Qin Shi Huang's National Road SystemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9305 Accepted Submission(s): 3306Problem Descri原创 2018-01-27 20:39:13 · 370 阅读 · 0 评论 -
poj2831Can We Build This One?
Can We Build This One?Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 1857 Accepted: 681Case Time Limit: 2000MSDescription“Highways are built, t原创 2018-01-27 20:42:55 · 163 阅读 · 0 评论 -
poj1679The Unique MST
The Unique MSTTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 33247 Accepted: 12102DescriptionGiven a connected undirected graph, tell if its minimum原创 2018-01-27 20:45:34 · 116 阅读 · 0 评论 -
uva10600ACM Contest and Blackout
题目:n个点,m条边,求最小生成树的值和次小生成树的值。代码:#include #include #include #include #include #include #include using namespace std;const int inf=0x3f3f3f3f;int g[105][105];int dis[105];int path[105][105];原创 2018-01-27 20:47:35 · 159 阅读 · 0 评论 -
Ural 1416 Confidential
题意:给你N个点,以及M条边,让你计算是否存在最小生成树和次小生成树,如果存在打印出权值,否则打印-1.代码:#include #include #include #include #include #include #include using namespace std;const int inf=0x3f3f3f3f;const int N=1005;int g[N]原创 2018-01-27 20:49:42 · 201 阅读 · 0 评论