【网络流】
关注
分享
扫一扫
文章平均质量分 86
Gijkstra
Can we do better?
展开
-
费用流（模板）
费用流模板 spfa不停找当前从s到t的最小费用路，然后刷新最大流 这里把每条边的cost为0，同样就可以求最大流，不过有点慢 #include #include #include #include #include #include #include #include #include #include #include #include using namespa原创 2018-01-11 17:49:29 · 318 阅读 · 0 评论 -
POJ3281 Dining(最大流+拆点)
Dining Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 20182 Accepted: 8970 Description Cows are such finicky eaters. Each cow has a preference for certa原创 2018-01-11 21:00:17 · 212 阅读 · 0 评论 -
hdu3416 Marriage Match IV(最短路+最大流)
Marriage Match IV Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4743 Accepted Submission(s): 1420 Problem Description Do not s原创 2018-01-12 11:01:18 · 324 阅读 · 0 评论 -
hdu3081 Marriage Match II(最大流+二分+并查集)
Marriage Match II Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4499 Accepted Submission(s): 1489 Problem Description Presumab原创 2018-01-12 10:17:55 · 248 阅读 · 0 评论 -
hdu3605 Escape(最大流+状态压缩)
Escape Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 11654 Accepted Submission(s): 2827 Problem Description 2012 If this is th原创 2018-01-12 09:28:53 · 263 阅读 · 0 评论 -
hdu3338 Kakuro Extension（最大流）
Kakuro Extension Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2425 Accepted Submission(s): 844 Special Judge Problem Description原创 2018-01-12 09:19:14 · 378 阅读 · 0 评论 -
hdu2732 Leapin' Lizards(最大流)
Leapin' Lizards Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3266 Accepted Submission(s): 1342 Problem Description Your plato原创 2018-01-12 09:00:42 · 224 阅读 · 0 评论 -
UVA10480 Sabotage （最小割+求路径）
The regime of a small but wealthy dictatorship has been abruptly overthrown by an unexpected rebellion. Because of the enormous disturbances this is causing in world economy, an imperialist military原创 2018-01-12 08:46:39 · 313 阅读 · 0 评论 -
hdu4289 Control（最小割）
Control Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3916 Accepted Submission(s): 1636 Problem Description You, the head of原创 2018-01-11 21:36:26 · 231 阅读 · 0 评论 -
poj 2516 Minimum Cost(费用流)
Minimum Cost Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 17714 Accepted: 6225 Description Dearboy, a goods victualer, now comes to a big problem, and原创 2018-01-11 21:24:41 · 185 阅读 · 0 评论 -
最大流（模板)
Dinic模板 O(n*m^2) 由于Dinic是在EK的基础上优化的，所以EK就不贴了 #include #include #include #include #define INF 0x3f3f3f3f #define mem(a,b) memset(a,b,sizeof(a)) using namespace std; const int maxn=10000+50; const原创 2018-01-11 17:32:04 · 200 阅读 · 0 评论 -
HDU 6437 Problem L.Videos(费用流)
Problem L.Videos Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others) Total Submission(s): 460 Accepted Submission(s): 224 Problem Description C-bacteria takes ...原创 2018-08-23 16:18:02 · 317 阅读 · 0 评论