
生成树
文章平均质量分 85
KinFungYu
前SCAU ACM校队队员
展开
-
hdu 1162 Eddy's picture
Eddy's pictureTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4866 Accepted Submission(s): 2411Problem DescriptionEddy begins原创 2013-04-25 10:38:25 · 807 阅读 · 0 评论 -
最小生成树计数(Kruskal+Matrix-Tree定理)
以下转载自:http://blog.youkuaiyun.com/jarily/article/details/8902402/* *算法引入: *给定一个含有N个结点M条边的无向图,求它最小生成树的个数t(G); * *算法思想: *抛开“最小”的限制不看,如果只要求求出所有生成树的个数,是可以利用Matrix-Tree定理解决的; *Matrix-Tree定理此定理利用图的Kirc转载 2014-11-15 23:46:59 · 1406 阅读 · 0 评论 -
hdu 4756 Install Air Conditioning(次小生成树变形+树dp)
Install Air ConditioningTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 294 Accepted Submission(s): 52Problem Description原创 2013-09-23 17:16:21 · 771 阅读 · 0 评论 -
hdu 4081 Qin Shi Huang's National Road System(次小生成树变形)
Qin Shi Huang's National Road SystemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1912 Accepted Submission(s): 689Problem Descrip原创 2013-07-29 13:10:45 · 716 阅读 · 0 评论 -
poj 1679 The Unique MST(次小生成树)
The Unique MSTTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 17061 Accepted: 5919DescriptionGiven a connected undirected graph, tell if its minimum spann原创 2013-07-07 22:31:37 · 711 阅读 · 0 评论 -
hdu 4313 Matrix(最大生成树)
MatrixTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1835 Accepted Submission(s): 703Problem DescriptionMachines have once a原创 2013-08-02 00:07:30 · 996 阅读 · 0 评论 -
hdu 4009 Transfer water(不定根的最小树形图)
Transfer waterTime Limit: 5000/3000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 2883 Accepted Submission(s): 1076Problem DescriptionXiaoA lives原创 2013-07-09 14:23:58 · 840 阅读 · 0 评论 -
hdu 2121 Ice_cream’s world II(不定根的最小树形图)
Ice_cream’s world IITime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1958 Accepted Submission(s): 453Problem DescriptionAfter原创 2013-07-09 10:40:37 · 803 阅读 · 0 评论 -
poj 3522 Slim Span
Slim SpanTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 5410 Accepted: 2840DescriptionGiven an undirected weighted graph G, you should find one of span原创 2013-07-08 14:51:44 · 754 阅读 · 0 评论 -
poj 3164 Command Network(最小树形图—朱刘算法模版)
Command NetworkTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 10259 Accepted: 2977DescriptionAfter a long lasting war on words, a war on arms finally原创 2013-07-08 22:32:55 · 880 阅读 · 0 评论 -
hdu 1232 畅通工程(最小生成树or并查集)
畅通工程Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20731 Accepted Submission(s): 10750Problem Description某省调查城镇交通状况,得到现有城镇道路统计表,原创 2013-04-25 15:43:33 · 712 阅读 · 0 评论 -
poj 2349 Arctic Network(最小瓶颈生成树)
Arctic NetworkTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 7323 Accepted: 2470DescriptionThe Department of National Defence (DND) wishes to connect sev原创 2013-07-08 12:48:57 · 1145 阅读 · 0 评论 -
hdu 1875 畅通工程再续(最小生成树)
畅通工程再续Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9126 Accepted Submission(s): 2786Problem Description相信大家都听说一个“百岛湖”的地方吧,百岛湖的原创 2013-04-25 20:13:03 · 707 阅读 · 0 评论 -
poj 2728 Desert King(最优比率生成树)
Desert KingTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 18091 Accepted: 5082DescriptionDavid the Great has just become the king of a desert country. To原创 2013-07-07 14:23:56 · 863 阅读 · 0 评论 -
hdu 1301 Jungle Roads
Jungle RoadsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3283 Accepted Submission(s): 2344Problem DescriptionThe Head原创 2013-04-25 14:56:56 · 731 阅读 · 0 评论 -
hdu 1102 Constructing Roads
Constructing RoadsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9879 Accepted Submission(s): 3675Problem DescriptionThere are N原创 2013-04-25 15:18:22 · 601 阅读 · 0 评论 -
生成树计数(Matrix-Tree定理)
以下转载自http://blog.youkuaiyun.com/jarily/article/details/8901363转载 2014-11-15 23:44:59 · 910 阅读 · 0 评论