最小费用流
lrccccc
靡不有初 鲜克有终
展开
-
POJ2135 Farm Tour 最小费用流
Farm TourTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15844 Accepted: 6135DescriptionWhen FJ's friends visit him on the farm, he likes to show them around. His farm comprise原创 2017-01-21 17:24:40 · 330 阅读 · 0 评论 -
POJ3422 Kaka's Matrix Travels 最小费用流
Kaka's Matrix TravelsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9608 Accepted: 3911DescriptionOn an N × N chessboard with a non-negative number in each grid, Kaka starts his m原创 2017-01-21 22:26:22 · 449 阅读 · 0 评论 -
POJ3680 Intervals 离散化+最小费用流
IntervalsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 7858 Accepted: 3311DescriptionYou are given N weighted open intervals. The ith interval covers (ai, bi) and weighs wi. Your原创 2017-01-22 13:29:27 · 377 阅读 · 0 评论 -
HDU5988Coding Contest 【费用流】
Coding ContestTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1199 Accepted Submission(s): 225Problem DescriptionA coding contest will be h原创 2017-02-21 22:35:41 · 324 阅读 · 0 评论 -
玲珑OJ 1047 - Best couple 【最小费用流orKM】
1047 - Best coupleTime Limit:1s Memory Limit:64MByteSubmissions:273Solved:77DESCRIPTIONThere are nn boys and mm girls, and they live in different n+mn+m cities.Th原创 2017-03-03 19:29:31 · 488 阅读 · 0 评论 -
HDU6118 度度熊的交易计划 【费用流】
链接百度之星的时候脑抽了… 跑了n次Dijkstra求了个全源最短路 拆点 i和j′的费用为cj−ai−disi,ji和j'的费用为c_j-a_i-dis_{i,j} S到i,流量为bi,费用为0, i′到T流量为di,费用为0S到i,流量为b_i,费用为0,\ i'到T流量为d_i,费用为0 这样边数2n2,TLE到爆这样边数2n^2,TLE到爆正解...直接按输入建图即可,拆点都不需要.原创 2017-08-14 14:30:33 · 1566 阅读 · 0 评论