poj 1459 Power Network 【多源多汇最大流经典问题 dinic算法】

最新推荐文章于 2024-01-31 15:12:27 发布

笑着走完自己的路

最新推荐文章于 2024-01-31 15:12:27 发布

阅读量1.2k

点赞数

分类专栏：网络流

本文链接：https://blog.csdn.net/chenzhenyu123456/article/details/46402561

版权

Power Network

Time Limit: 2000MS		Memory Limit: 32768K
Total Submissions: 24558		Accepted: 12814

Description

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 <= p(u) <= p _max(u) of power, may consume an amount 0 <= c(u) <= min(s(u),c _max(u)) of power, and may deliver an amount d(u)=s(u)+p(u)-c(u) of power. The following restrictions apply: c(u)=0 for any power station, p(u)=0 for any consumer, and p(u)=c(u)=0 for any dispatcher. There is at most one power transport line (u,v) from a node u to a node v in the net; it transports an amount 0 <= l(u,v) <= l _max(u,v) of power delivered by u to v. Let Con=Σ _uc(u) be the power consumed in the net. The problem is to compute the maximum value of Con.