![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
网络流
文章平均质量分 86
1A_coder
Just for fun!
展开
-
poj 3422 Kaka's Matrix Travels (费用流)
Kaka's Matrix TravelsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7743 Accepted: 3111DescriptionOn an N × N chessboard with a non-negative number i原创 2014-08-13 16:53:25 · 727 阅读 · 0 评论 -
poj 1149 PIGS (dinic)
PIGSTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 16054 Accepted: 7185DescriptionMirko works on a pig farm that consists of M locked pig-houses and原创 2014-08-05 15:37:31 · 649 阅读 · 0 评论 -
hdu 1532 poj 1273 Drainage Ditches (ek算法)
Drainage DitchesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 55276 Accepted: 21122DescriptionEvery time it rains on Farmer John's fields, a pond fo原创 2014-07-28 20:40:49 · 568 阅读 · 0 评论 -
hdu 3572 Task Schedule (dinic算法)
Task ScheduleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3412 Accepted Submission(s): 1197Problem DescriptionOur geometry原创 2014-07-31 16:50:31 · 1205 阅读 · 0 评论 -
poj 1698 Alice's Chance(ek算法)
Alice's ChanceTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5280 Accepted: 2171DescriptionAlice, a charming girl, have been dreaming of being a movi原创 2014-07-29 20:56:03 · 713 阅读 · 0 评论 -
poj 1459 Power Network (dinic)
Power NetworkTime Limit: 2000MS Memory Limit: 32768KTotal Submissions: 23059 Accepted: 12072DescriptionA power network consists of nodes (power stations, consum原创 2014-08-16 10:47:23 · 778 阅读 · 0 评论 -
hdu 3549 Flow Problem (ek算法模板)
Problem DescriptionNetwork flow is a well-known difficult problem for ACMers. Given a graph, your task is to find out the maximum flow for the weighted directed graph. InputThe first line of input c原创 2013-11-07 18:22:13 · 626 阅读 · 0 评论 -
dinic算法学习(以poj1273为例)
Dinic 算法模板 Dinic算法是一种比较容易实现的,相对比较快的最大流算法。求最大流的本质,就是不停的寻找增广路径。直到找不到增广路径为止。对于这个一般性的过程,Dinic算法的优化如下:(1)Dinic算法首先对图进行一次BFS,然后在BFS生成的层次图中进行多次DFS。层次图的意思就是,只有在BFS树中深度相差1的节点才是连接的。这就切断了原有的图中的许多原创 2014-07-31 10:23:32 · 1130 阅读 · 0 评论 -
poj 2135 Farm Tour (最小费用最大流模板)
Farm TourTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11372 Accepted: 4218DescriptionWhen FJ's friends visit him on the farm, he likes to show them原创 2014-08-13 10:45:32 · 1211 阅读 · 0 评论