最小生成树
文章平均质量分 82
yibin94
这个作者很懒,什么都没留下…
展开
-
CSU--1541-- There is No Alternative
F - There is No AlternativeCrawling in process...Crawling failedTime Limit:3000MS Memory Limit:262144KB 64bit IO Format:%lld & %llu SubmitStatus Practice CSU 1541原创 2015-11-12 14:18:34 · 596 阅读 · 0 评论 -
POJ--2421--Constructing Roads
Constructing RoadsCrawling in process...Crawling failedTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmitStatus Practice POJ 2421 Appoint descr原创 2015-11-13 14:48:44 · 491 阅读 · 0 评论 -
POJ--1679--The Unique MST
The Unique MSTCrawling in process...Crawling failedTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmitStatus Practice POJ 1679 Description原创 2015-11-13 13:36:53 · 488 阅读 · 0 评论 -
ZOJ--1586--QS Network
QS NetworkCrawling in process...Crawling failedTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmitStatus Practice ZOJ 1586 Appoint description:S原创 2015-11-13 15:17:08 · 503 阅读 · 0 评论 -
POJ--1251--Jungle Roads
Jungle RoadsCrawling in process...Crawling failedTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmitStatus Practice POJ 1251 Description原创 2015-11-13 14:27:17 · 462 阅读 · 0 评论 -
prim 算法优化
prim 算法优化:普通法:int nearvex[Maxn], lowest[Maxn], road[Maxn][Maxn], n; int prim(int u) //从u出发构造最小生成树,共n个点{ int i, j, k, min, cost=0; for(i=0;i<n;i++){//顶点下标从0开始 lowest[i]=road[u][i]; /原创 2015-11-13 15:38:17 · 791 阅读 · 0 评论 -
poj 1789--Truck History 最小生成树(prim)
Truck HistoryTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1789DescriptionAdvanced Cargo Movement, Ltd. uses trucks of di原创 2016-04-02 19:14:52 · 401 阅读 · 0 评论