网络流
WePlayDirty
emmmmmmm
展开
-
poj2516 minimum cost 最小费用流
/* * 把k种物品分开算 再求和 * 和EK最大流算法差不多,只不过EK算法是BFS搜索深度最小的可行路径作为增广路,而最小费用流是找权值最小的可行路径作为增广 * 路。(这里可行路径指可以使流量增大的路径) * 这个代码完全是根据POJ1459改的,我把1459的代码贴在最下面了,就不讲了,还是画图,看代码才能理解。 * *顺便说一下,有人说不知道增广路是什么,其实他原创 2016-01-28 19:58:39 · 3094 阅读 · 0 评论 -
poj2516Minimum Cost最小费用最大流
Description Dearboy, a goods victualer, now comes to a big problem, and he needs your help. In his sale area there are N shopkeepers (marked from 1 to N) which stocks goods from him.Dearboy has M s原创 2016-02-21 10:13:03 · 2190 阅读 · 0 评论