![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
网络流
hehedad
这个作者很懒,什么都没留下…
展开
-
HDU - 4289 Control(拆点+网络流||最小割)
Control Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4578 Accepted Submission(s): 1890 Problem Description Yo...原创 2018-08-09 10:39:37 · 215 阅读 · 0 评论 -
POJ - 2516 Minimum Cost(最小费用最大流)
Minimum Cost Time Limit:4000MS Memory Limit:65536K Total Submissions:19247 Accepted:6789 Description Dearboy, a goods victualer, now comes to a big problem, and he needs your...原创 2019-03-14 18:47:37 · 95 阅读 · 0 评论 -
HDU - 3879 Base Station (最大权闭合子图)
A famous mobile communication company is planning to build a new set of base stations. According to the previous investigation, n places are chosen as the possible new locations to build those new sta...原创 2019-02-25 21:07:56 · 159 阅读 · 0 评论 -
HDU - 6437 Problem L.Videos (最小费用最大流)
C-bacteria takes charge of two kinds of videos: ’The Collection of Silly Games’ and ’The Collection of Horrible Games’. For simplicity’s sake, they will be called as videoA and videoB. There are som...原创 2018-10-02 02:54:02 · 192 阅读 · 0 评论 -
HDU - 6214 Smallest Minimum Cut(最小割边集的最小数量)
Consider a network G=(V,E)G=(V,E) with source ss and sink tt. An s-t cut is a partition of nodes set VV into two parts such that ss and tt belong to different parts. The cut set is the subset of EE wi...原创 2018-08-24 19:08:57 · 264 阅读 · 0 评论 -
HDU - 4280 Island Transport (双向图中最大流)
In the vast waters far far away, there are many islands. People are living on the islands, and all the transport among the islands relies on the ships. You have a transportation company there. Some...原创 2018-08-08 23:33:33 · 411 阅读 · 0 评论 -
POJ - 2516 Minimum Cost (最小费用最大流)
Minimum Cost Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 18305 Accepted: 6465 Description Dearboy, a goods victualer, now comes to a big problem, and he needs your...原创 2018-08-08 19:27:24 · 160 阅读 · 0 评论 -
最小费用最大流的模板spfa
#include<iostream> #include<cstdio> #include<queue> #include<algorithm> using namespace std; const int maxn = 100005; const int maxm = 1000500; const int inf = 0x3f3f3f3f; str...原创 2018-08-08 16:31:52 · 415 阅读 · 0 评论 -
POJ - 2195 Going Home (最小费用最大流)
Going Home Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 25156 Accepted: 12597 Description On a grid map there are n little men and n houses. In each unit time, ever...原创 2018-08-08 16:30:41 · 110 阅读 · 0 评论 -
POJ - 3436 ACM Computer Factory (拆点+网络流)
ACM Computer Factory Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9241 Accepted: 3412 Special Judge Description As you know, all the computers used for ACM ...原创 2018-08-08 08:56:21 · 277 阅读 · 0 评论 -
POJ - 3281 Dining (拆点+dinic最大流)
Dining Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 22184 Accepted: 9851 Description Cows are such finicky eaters. Each cow has a preference for certain foods and d...原创 2018-08-07 19:19:42 · 136 阅读 · 0 评论 -
Dinic+弧优化模板
#include<iostream> #include<cstdio> #include<cstring> #include<queue> #include<algorithm> using namespace std; #define inf 0x3f3f3f3f const int maxn = 100010; const int ...原创 2018-08-07 16:00:58 · 291 阅读 · 2 评论 -
HDU - 3081 Marriage Match II (最大流+二分+并查集+(*你*别忘了别再建重边了))
Presumably, you all have known the question of stable marriage match. A girl will choose a boy; it is similar as the game of playing house we used to play when we are kids. What a happy time as so man...原创 2018-08-10 11:53:55 · 184 阅读 · 0 评论 -
UVA - 10480 Sabotage 最大流最小割+ 输出割边集
因为是pdf形式我就不把题目弄上来了,就写主要需要注意的两点: 1.输出割边集。正确的写法是先按照源点开始dfs,如果某一边得剩余流量大于0就继续向下探索另一个点并标记,等于零就跳过这一边。最后把所有的边找出来,看看如果有两个点标记不一样(一个标记了一个没标记),就输出这个边就好了(因为我们建立的是双向便所以别忘了遍历时每次加2)。 但是我在没看这种做法得时候,我是想把所有得剩余流量...原创 2018-08-09 16:42:02 · 147 阅读 · 0 评论 -
HDU - 6582 Path(spfa+最大流)
Years later, Jerry fell in love with a girl, and he often walks for a long time to pay visits to her. But, because he spends too much time with his girlfriend, Tom feels neglected and wants to prevent...原创 2019-07-24 19:29:24 · 508 阅读 · 4 评论