生成树
关注
分享
扫一扫
文章平均质量分 83
ummmmm
这个作者很懒，什么都没留下…
展开
-
[最小生成树] 畅通工程再续 HDU图论03 1003
畅通工程再续Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 20 Accepted Submission(s) : 14Font: Times New Roman | Verdana | GeorgiaFont Size: ← →Probl...原创 2018-06-21 10:00:42 · 123 阅读 · 0 评论 -
[最小树形图(朱刘算法)] F - Teen Girl Squad UVA - 11183
You are part of a group of n teenage girls armed with cellphones. You have some news you wantto tell everyone in the group. The problem is that no two of you are in the same room, and you mustcommunic...原创 2018-07-03 14:20:54 · 238 阅读 · 0 评论 -
【最小树形图 朱刘算法 O(VE)】 Command Network POJ - 3164
After a long lasting war on words, a war on arms finally breaks out between littleken’s and KnuthOcean’s kingdoms. A sudden and violent assault by KnuthOcean’s force has rendered a total failure of li...原创 2018-06-27 12:10:53 · 194 阅读 · 0 评论 -
[次小生成树Prim] Is There A Second Way Left? UVA 10462
Nasa, being the most talented programmer of his time, can’t think things to be so simple. Recently allhis neighbors have decided to connect themselves over a network (actually all of them want to shar...原创 2018-06-26 16:37:50 · 176 阅读 · 0 评论 -
[最小生成树] 继续畅通工程 HDU图论03 1004
继续畅通工程Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 17 Accepted Submission(s) : 14Font: Times New Roman | Verdana | GeorgiaFont Size: ← →Probl...原创 2018-06-19 21:18:17 · 108 阅读 · 0 评论 -
[最小生成树] 畅通工程 HDU图论03 1002
畅通工程Time Limit : 4000/2000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 32 Accepted Submission(s) : 20Font: Times New Roman | Verdana | GeorgiaFont Size: ← →Problem...原创 2018-06-19 20:52:40 · 118 阅读 · 0 评论 -
[次小生成树Prim] Contest and Blackout UVA 10600
In order to prepare the “The First National ACM School Contest” (in 20??) the major of the citydecided to provide all the schools with a reliable source of power. (The major is really afraid ofblackou...原创 2018-06-26 12:53:42 · 132 阅读 · 0 评论 -
[最小生成树] Constructing Roads HDU图论03 1001
Constructing RoadsTime Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 27 Accepted Submission(s) : 17Font: Times New Roman | Verdana | GeorgiaFont Si...原创 2018-06-09 21:53:32 · 150 阅读 · 0 评论 -
[最小生成树] 洛谷P3366
题目描述如题，给出一个无向图，求出最小生成树，如果该图不连通，则输出orz输入输出格式输入格式：第一行包含两个整数N、M，表示该图共有N个结点和M条无向边。（N<=5000，M<=200000）接下来M行每行包含三个整数Xi、Yi、Zi，表示有一条长度为Zi的无向边连接结点Xi、Yi输出格式：输出包含一个数，即最小生成树的各边的长度之和；如果该图不连通则输出orz输入输出样例输入样例#...原创 2018-06-09 12:42:17 · 235 阅读 · 0 评论 -
【次小生成树/Prim】Qin Shi Huang's National Road System HDU4081
During the Warring States Period of ancient China(476 BC to 221 BC), there were seven kingdoms in China ---- they were Qi, Chu, Yan, Han, Zhao, Wei and Qin. Ying Zheng was the king of the ki...原创 2018-06-23 14:53:19 · 217 阅读 · 0 评论 -
[最大生成树Kruskal/倍增LCA] 火车运输 洛谷P1967
题目描述AA 国有 nn 座城市，编号从 11 到 nn ，城市之间有 mm 条双向道路。每一条道路对车辆都有重量限制，简称限重。现在有 qq 辆货车在运输货物， 司机们想知道每辆车在不超过车辆限重的情况下，最多能运多重的货物。输入输出格式输入格式：第一行有两个用一个空格隔开的整数 n,mn,m ，表示 AA 国有 nn 座城市和 mm 条道路。接下来 mm 行每行 33 个整数 x, y, zx...原创 2018-06-07 11:40:39 · 205 阅读 · 0 评论 -
[最小树形图 边 超级汇点] Ice_cream’s world II HDU2121
G - Ice_cream’s world II HDU - 2121 #include <bits/stdc++.h>using namespace std;const int inf = 0x3f3f3f3f;const int mn = 1010, mm = 10010;int n, m;struct node{ int s, t, c;} e[mm + m...原创 2018-07-06 17:04:01 · 178 阅读 · 0 评论