![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
网络流
文章平均质量分 84
丿残念灬
这个作者很懒,什么都没留下…
展开
-
hdu-1853 Cyclic Tour(最小费用最大流)
Cyclic TourTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/65535 K (Java/Others)Total Submission(s): 2376 Accepted Submission(s): 1218Problem DescriptionThere are N ci原创 2016-10-26 00:44:20 · 476 阅读 · 0 评论 -
POJ-2195 Going Home(最小费用最大流)
Going HomeTime Limit: 1000MS Memory Limit: 65536K Total Submissions: 21918 Accepted: 11087 DescriptionOn a grid map there are n little men and n houses. In each unit time, ever...原创 2016-10-26 13:18:57 · 430 阅读 · 0 评论 -
POJ-1273 Drainage Ditches(最大流)
Drainage DitchesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 71209 Accepted: 27705DescriptionEvery time it rains on Farmer John's fields, a pond fo原创 2016-10-27 17:33:29 · 2033 阅读 · 0 评论 -
POJ-3281 Dining(最大流)
DiningTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 15653 Accepted: 7085DescriptionCows are such finicky eaters. Each cow has a preference for certa原创 2016-11-02 00:28:07 · 206 阅读 · 0 评论 -
BZOJ-2597 [Wc2007]剪刀石头布(费用流)
2597: [Wc2007]剪刀石头布Time Limit: 20 Sec Memory Limit: 128 MBSec Special JudgeSubmit: 1146 Solved: 538[Submit][Status][Discuss]Description在一些一对一游戏的比赛(如下棋、乒乓球和羽毛球的单打)中,我们经常会遇到A胜过B,B胜过C而C又胜过原创 2017-03-23 20:53:48 · 588 阅读 · 0 评论 -
计蒜客-腾讯狼人杀(网络流+最大密度子图)
传送门:https://nanti.jisuanke.com/t/15549一道论文题,具体求解过程就不详将了(毕竟本人太菜了)推荐看《最小割模型在信息学竞赛中的应用》这本论文,很好的诠释了最大密度子图在网络流中的应用题解:网络流+最大密度子图c(s,v)=Uc(v,t)=U+4ng-2g-duc(u,v)=mp[u][v]+2g其中du为与点u相连的边的总权值,g为二原创 2017-07-14 22:45:59 · 543 阅读 · 0 评论 -
HDU-6126 Give out candies(最小割)
传送门:HDU-6126有nn个小朋友,标号为11到nn,你要给每个小朋友至少11个且至多mm个的糖果。小朋友们共提出kk个要求,每个要求包括三个整数x,y,zx,y,z,表示xx号小朋友得到的糖果数减去yy号小朋友得到的糖果数,结果应当不大于zz。如果你给ii号小朋友jj颗糖果,他会获得w_{i,j}wi,j的满意度,你需要最大化所有小朋友的满意度之和。1\leq n,m\leq5原创 2017-08-16 17:29:20 · 518 阅读 · 0 评论 -
POJ-2914 Minimum Cut(全局最小割)
Minimum CutTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 9913 Accepted: 4158Case Time Limit: 5000MSDescriptionGiven an undirected graph, in w原创 2017-08-05 23:56:54 · 363 阅读 · 0 评论