![](https://img-blog.csdnimg.cn/20201014180756922.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
【网络流】
文章平均质量分 85
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 · 288 阅读 · 0 评论 -
POJ3281 Dining(最大流+拆点)
DiningTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 20182 Accepted: 8970DescriptionCows are such finicky eaters. Each cow has a preference for certa原创 2018-01-11 21:00:17 · 184 阅读 · 0 评论 -
hdu3416 Marriage Match IV(最短路+最大流)
Marriage Match IVTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4743 Accepted Submission(s): 1420Problem DescriptionDo not s原创 2018-01-12 11:01:18 · 295 阅读 · 0 评论 -
hdu3081 Marriage Match II(最大流+二分+并查集)
Marriage Match IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4499 Accepted Submission(s): 1489Problem DescriptionPresumab原创 2018-01-12 10:17:55 · 217 阅读 · 0 评论 -
hdu3605 Escape(最大流+状态压缩)
EscapeTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 11654 Accepted Submission(s): 2827Problem Description2012 If this is th原创 2018-01-12 09:28:53 · 234 阅读 · 0 评论 -
hdu3338 Kakuro Extension(最大流)
Kakuro ExtensionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2425 Accepted Submission(s): 844Special JudgeProblem Description原创 2018-01-12 09:19:14 · 259 阅读 · 0 评论 -
hdu2732 Leapin' Lizards(最大流)
Leapin' LizardsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3266 Accepted Submission(s): 1342Problem DescriptionYour plato原创 2018-01-12 09:00:42 · 195 阅读 · 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 · 287 阅读 · 0 评论 -
hdu4289 Control(最小割)
ControlTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3916 Accepted Submission(s): 1636Problem Description You, the head of原创 2018-01-11 21:36:26 · 207 阅读 · 0 评论 -
poj 2516 Minimum Cost(费用流)
Minimum CostTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 17714 Accepted: 6225DescriptionDearboy, a goods victualer, now comes to a big problem, and原创 2018-01-11 21:24:41 · 164 阅读 · 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 · 177 阅读 · 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): 224Problem Description C-bacteria takes ...原创 2018-08-23 16:18:02 · 285 阅读 · 0 评论