![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
最小费用最大流
coldfresh
那我们开始吧
展开
-
Tour HDU - 3488(带权二分匹配)(最小花费最大流)
In the kingdom of Henryy, there are N (2 <= N <= 200) cities, with M (M <= 30000) one-way roads connecting them. You are lucky enough to have a chance to have a tour in the kingdom. The route should be原创 2017-11-07 14:37:47 · 380 阅读 · 0 评论 -
A new Graph Game HDU - 3435 (二分匹配思想)(最小花费最大流)
传送门 题目同上 史上速度最快ac#include<iostream> #include<cstdio> #include<cmath> #include<cstring> #include<queue> using namespace std; const int maxn=2005;//点的最大上线 const int maxx=44005;//边的最大上线 const int INF=1<原创 2017-11-07 15:05:30 · 248 阅读 · 0 评论 -
Going Home HDU - 1533(最小费用最大流)
On a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, or vertically, to an adjacent point. For each little man, you need to原创 2017-10-25 00:04:37 · 248 阅读 · 0 评论 -
最小花费最大流模板
自己写的最小花费最大流模板#include<iostream> #include<cstdio> #include<cmath> #include<cstring> #include<queue> using namespace std; const int maxn=10010;//点数 const int maxx=100100;//边数,注意为实际上边数的两倍 const int INF=1<原创 2017-10-25 11:40:30 · 262 阅读 · 0 评论