
网络流
team39
喜欢写注释
展开
-
F - Power Network (Dinic 邻接表+queue)
F - 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 ...原创 2018-08-03 18:41:18 · 200 阅读 · 0 评论 -
B-Dining(EK算法)
B - Dining Cows are such finicky eaters. Each cow has a preference for certain foods and drinks, and she will consume no others. Farmer John has cooked fabulous meals for his cows, but he forgot ...原创 2018-08-02 18:05:30 · 270 阅读 · 0 评论 -
Minimum Cost ——多源点最小费用最大流
E - Minimum Cost 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 h...原创 2018-08-15 18:09:36 · 1116 阅读 · 0 评论