![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
网络流
better_life30
这个作者很懒,什么都没留下…
展开
-
(二分图最大匹配)The Perfect Stall
题目链接:http://poj.org/problem?id=1274 入门题目,暖身。 改最大流模板的解法: #include #include #include #include #include using namespace std; const int maxn = 205; typedef long long LL; const int INF = 0xfffffff;原创 2015-04-10 22:38:04 · 285 阅读 · 0 评论 -
(网络流_最大流)Flow Problem
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3549 入门题目,纪念。 #include #include #include #include #include using namespace std; const int maxn = 25; typedef long long LL; const int INF = 0xfffff原创 2015-04-10 21:42:25 · 310 阅读 · 0 评论 -
(最小费用最大流)The Exchange of Items (141 - ZOJ Monthly, July 2015 - E )
The Exchange of Items Time Limit: 2 Seconds Memory Limit: 65536 KB Bob lives in an ancient village, where transactions are done by one item exchange with another. Bob is very clever a原创 2015-07-28 16:58:27 · 474 阅读 · 0 评论 -
(最小割)poj 3308 Paratroopers
Paratroopers Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7915 Accepted: 2379 Description It is year 2500 A.D. and there is a terrible war between the f原创 2015-09-04 20:46:15 · 413 阅读 · 0 评论