摘要:
3130: [Sdoi2013]费用流 Description Alice和Bob在图论课程上学习了最大流和最小费用最大流的相关知识。 最大流问题:给定一张有向图表示运输网络,一个源点S和一个汇点T,每条边都有最大流量。一个合法的网络流方案必须满足:(1)每条边的实际流量都不超过其最大流量且非负;( 阅读全文
posted @ 2016-11-25 23:57
Candy?
阅读(476)
评论(0)
推荐(0)
摘要:
Secret Milking Machine Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 11865 Accepted: 3445 Description Farmer John is constructing a new m 阅读全文
posted @ 2016-11-25 21:34
Candy?
阅读(876)
评论(0)
推荐(0)
摘要:
Dining Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 16352 Accepted: 7307 Description Cows are such finicky eaters. Each cow has a prefer 阅读全文
posted @ 2016-11-25 20:18
Candy?
阅读(302)
评论(0)
推荐(0)
摘要:
Drainage Ditches Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 71559 Accepted: 27846 Description Every time it rains on Farmer John's fie 阅读全文
posted @ 2016-11-25 19:32
Candy?
阅读(231)
评论(0)
推荐(0)

浙公网安备 33010602011771号