![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
专题十一 网络流
Focus5679
学生一枚
展开
-
A - ACM Computer Factory POJ - 3436 最大流 拆点 汇源
A - ACM Computer Factory POJ - 3436 As you know, all the computers used for ACM contests must be identical, so the participants compete on equal terms. That is why all these computers are historic...原创 2019-04-29 21:53:32 · 158 阅读 · 0 评论 -
B - Dining POJ - 3281 最大流
B - Dining POJ - 3281 Cows are such finicky eaters. Each cow has a preference for certain foods and drinks, and she will consume no others. Farmer John has cooked fabulous meals for his cows, but...原创 2019-05-06 16:42:18 · 185 阅读 · 0 评论 -
代码模板——P3381 【模板】最小费用最大流 dij版
vector版: // luogu-judger-enable-o2 #include<bits/stdc++.h> using namespace std; const int MAXN = 5e3+50; const int INF = 0x3f3f3f3f; typedef pair<int, int> P; struct edge{int to, cap, ...原创 2019-07-30 16:32:39 · 186 阅读 · 0 评论 -
2019 Multi-University Training Contest 3 K Subsequence hdu6611 (费用流,dij优化)
K Subsequence Time Limit: 2000/2000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1992Accepted Submission(s): 457 Problem Description Master QWsin is dati...原创 2019-07-31 08:34:33 · 111 阅读 · 0 评论 -
2019 Multi-University Training Contest 1 1005 Path HDU6582 (迪杰斯特拉,最小割)
Path Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 1353Accepted Submission(s): 351 Problem Description Years later, Jerry fell in ...原创 2019-07-22 19:53:22 · 124 阅读 · 0 评论