随笔分类 -  ACM-Graph

1 2 3 4 下一页
【图算法】Dijkstra算法及变形
摘要：图示： 模版： 变形1：PAT 1030:http://www.patest.cn/contests/pat-a-practise/1030 题意：在原有计算weight的基础之上，再添加一个cost，最短路不唯一时，cost取最小。 分析： 变形2：PAT 1018：http://pat.zju. 阅读全文
posted @ 2014-11-10 21:51 max_xbw 阅读(589) 评论(0) 推荐(0)
【图算法】综述
摘要：from wiki： 阅读全文
posted @ 2014-11-10 01:24 max_xbw 阅读(357) 评论(0) 推荐(0)
POJ---1149 PIGS[dinic()最大流]
摘要：PIGSTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 12578Accepted: 5560DescriptionMirko works on a pig farm that consists of M locked pig-hou... 阅读全文
posted @ 2012-09-08 00:52 max_xbw 阅读(301) 评论(0) 推荐(0)
POJ---1273 Drainage Ditches[最大流Dinic()]
摘要：Drainage DitchesTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 42080Accepted: 15783DescriptionEvery time it rains on Farmer John's fields, a... 阅读全文
posted @ 2012-09-05 01:25 max_xbw 阅读(253) 评论(0) 推荐(0)
POJ---3463 Sightseeing[Dijkstra（）求最短路和次短路条数][好题]
摘要：SightseeingTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 5842Accepted: 2031DescriptionTour operator Your Personal Holiday organises guided ... 阅读全文
posted @ 2012-09-03 20:26 max_xbw 阅读(1090) 评论(0) 推荐(1)
POJ---3013 Big Christmas Tree[数据超大，谨慎小心]
摘要：Big Christmas TreeTime Limit: 3000MSMemory Limit: 131072KTotal Submissions: 17317Accepted: 3644DescriptionChristmas is coming to KCM city. Suby the lo... 阅读全文
posted @ 2012-08-29 23:02 max_xbw 阅读(283) 评论(0) 推荐(0)
POJ---2449 Remmarguts' Date[K短路入门题（Dijkstra()||Spfa()+A*）]
摘要：Remmarguts' DateTime Limit: 4000MSMemory Limit: 65536KTotal Submissions: 15399Accepted: 4202Description"Good man never makes girls wait or breaks an a... 阅读全文
posted @ 2012-08-29 01:26 max_xbw 阅读(346) 评论(0) 推荐(0)
HDOJ---1045 Fire Net[二分图-匈牙利算法]
摘要：Fire NetTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3676Accepted Submission(s): 2114Problem De... 阅读全文
posted @ 2012-08-27 17:08 max_xbw 阅读(405) 评论(0) 推荐(0)
POJ---1860 Currency Exchange[套汇问题SPFA()正权回路的判定]
摘要：Currency ExchangeTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 13730Accepted: 4716DescriptionSeveral currency exchange points are working i... 阅读全文
posted @ 2012-08-26 21:19 max_xbw 阅读(434) 评论(0) 推荐(0)
HDOJ---1116 Play on Words[并查集+欧拉回路]
摘要：Play on WordsTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2938Accepted Submission(s): 935Probl... 阅读全文
posted @ 2012-08-25 10:47 max_xbw 阅读(516) 评论(0) 推荐(0)
HDOJ---1301 Jungle Roads[最小生成树--Prim（）]
摘要：Jungle RoadsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2920Accepted Submission(s): 2064Proble... 阅读全文
posted @ 2012-08-24 12:13 max_xbw 阅读(201) 评论(0) 推荐(0)
HDOJ---1281 棋盘游戏[匈牙利（最大匹配）+枚举]
摘要：棋盘游戏Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1286Accepted Submission(s): 737Problem Descrip... 阅读全文
posted @ 2012-08-24 11:18 max_xbw 阅读(234) 评论(0) 推荐(0)
HDOJ---1599 find the mincost route[floyd 判最小环]
摘要：find the mincost routeTime Limit: 1000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 886Accepted Submission(s): 3... 阅读全文
posted @ 2012-08-20 00:37 max_xbw 阅读(291) 评论(0) 推荐(0)
传说中效率最高的最大流算法(Dinic) [转]
摘要：转自：http://www.cnblogs.com/zhuangli/archive/2008/09/07/1259527.html#1310894呵呵,又从DK那偷代码了,好兴奋哈,以下是这个算法的简单介绍,不过我用它去解决HDU的1532 竟然TLE,郁闷.到时候再继续问问DK吧...so 烦躁... 阅读全文
posted @ 2012-08-17 17:20 max_xbw 阅读(514) 评论(0) 推荐(0)
POJ---1273 Drainage Ditches[EK()]
摘要：Drainage DitchesTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 41645Accepted: 15583DescriptionEvery time it rains on Farmer John's fields, a... 阅读全文
posted @ 2012-08-16 23:35 max_xbw 阅读(184) 评论(0) 推荐(0)
POJ---3259 Wormholes[SPFA模版]
摘要：WormholesTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 20567Accepted: 7314DescriptionWhile exploring his many farms, Farmer John has discov... 阅读全文
posted @ 2012-08-16 21:59 max_xbw 阅读(197) 评论(0) 推荐(0)
最短路算法(Shortest Paths Algorithm)
摘要：假如你有一张地图，地图上给出了每一对相邻城市的距离，从一个地点到另外一个地点，如何找到一条最短的路？ 最短路算法要解决的就是这类问题。定义：给定一个有(无)向图，每一条边有一个权值 w，给定一个起始点 S 和终止点 T ，求从 S 出发走到 T 的权值最小路径，即为最短路径。最短路算法依赖一种性质：... 阅读全文
posted @ 2012-08-15 23:46 max_xbw 阅读(2039) 评论(0) 推荐(2)
网络流题目
摘要：View Code 【HDU】1532 Drainage Ditches(基础) [最大流]3549 Flow Problem(基础) [最大流]3572 Task Schedule [最大流]任务分配,判断满流2732 Leapin' Lizards(难) [最大流]3338 Kakuro Ext... 阅读全文
posted @ 2012-08-15 17:40 max_xbw 阅读(892) 评论(0) 推荐(0)
HDOJ---1054 Strategic Game[求最小顶点覆盖-无向图]
摘要：Strategic GameTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2892Accepted Submission(s): 1206Pr... 阅读全文
posted @ 2012-08-15 17:07 max_xbw 阅读(743) 评论(0) 推荐(0)
HDOJ---1532||POJ---1273 Drainage Ditches[最大流-模版]
摘要：Drainage DitchesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4515Accepted Submission(s): 2108Pr... 阅读全文
posted @ 2012-08-15 11:45 max_xbw 阅读(216) 评论(0) 推荐(0)

1 2 3 4 下一页