最小费用流
文章平均质量分 78
墨温温
呆萌理工女~ ~
展开
-
HDU 1533
Going HomeTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3469 Accepted Submission(s): 1780Problem DescriptionOn a grid原创 2015-09-02 19:39:20 · 390 阅读 · 0 评论 -
连续增广路算法
const int maxn = 110;const int maxm = 5010;struct Edge{ int to, next, c, f;}edge[maxm*10];int head[maxn],dis[maxn],load[maxn],p[maxn];int n;bool flag[maxn];bool spfa(int start,int end){原创 2015-09-01 22:19:15 · 473 阅读 · 0 评论 -
(最小费用最大流模板)HDU 3488
/* Created by mowenwen ~~~~ 2015.10.01*/#include #include #include #include #include #include using namespace std;#define maxn 10000+10#define inf 0x7fffffffint k, p;int tot;i原创 2015-10-02 09:35:33 · 342 阅读 · 0 评论 -
HDU 3435
#include #include #include #include #include using namespace std;#define maxn 3000#define inf 0x7ffffffint t, n, m, tot;int ans_flow;int head[maxn], p1[maxn], p2[maxn], flag[maxn], dis[maxn]原创 2015-10-02 11:17:44 · 388 阅读 · 0 评论