网络流
LLL_yx
这个作者很懒,什么都没留下…
展开
-
HDU - 1853 Cyclic Tour(网络流-最小费用最大流)
There are N cities in our country, and M one-way roads connecting them. Now Little Tom wants to make several cyclic tours, which satisfy that, each cycle contain at least two cities, and each city bel原创 2017-07-28 10:41:22 · 241 阅读 · 0 评论 -
POJ - 1459 Power Network(网络流-最大流)
A power network consists of nodes (power stations, consumers and dispatchers) connected by power transport lines. A node u may be supplied with an amount s(u) >= 0 of power, may produce an amount 0 <=原创 2017-07-28 11:04:01 · 226 阅读 · 0 评论 -
FZU - 2295 Human life(网络流)
题目链接:http://acm.fzu.edu.cn/problem.php?pid=2295 题意:有n种技能,技能有前置技能,学技能要花钱,有m种工作,工作有前置技能(需要学了这个技能才能做这份工作),工作可以挣钱,然后给出k,有k组工作冲突(即不能同时选)。 思路:这种有前置要求的,有价值和消耗的一般都是最大权闭合子图。这个题直接按最大权闭合子图建图,但是这里有一个条件k,这里k很小,只...原创 2018-08-26 20:53:00 · 323 阅读 · 0 评论