网络流
文章平均质量分 81
Twenty_seven
这个作者很懒,什么都没留下…
展开
-
poj1087 最大流
如题:http://poj.org/problem?id=1087 A Plug for UNIX Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 14252 Accepted: 4796 Description You are in charge of s原创 2015-04-02 15:11:53 · 402 阅读 · 0 评论 -
最大流Ford_Fulkerson
#include #include using namespace std; #define INF 0x0fffffff #define min(a,b)(a #define MAX_V 1000 struct edge { int to,cap,rev; //指向to的反向边的标号 edge(){} edge(int a,int b,int c):to(a),cap(原创 2015-04-01 10:43:30 · 433 阅读 · 0 评论 -
poj1459最大流
如题:http://poj.org/problem?id=1459 Power Network Time Limit: 2000MS Memory Limit: 32768K Total Submissions: 24182 Accepted: 12609 Description A power network consists o原创 2015-04-04 16:16:50 · 408 阅读 · 0 评论 -
poj3057 bfs+二分匹配
如题:http://poj.org/problem?id=3057 Evacuation Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 1624 Accepted: 406 Description Fires can be disastrous, espe原创 2015-04-18 09:54:35 · 387 阅读 · 0 评论 -
poj1149 最大流
原文:http://wenku.baidu.com/view/0ad00abec77da26925c5b01c.html 下面贴上自己的代码: 邻接矩阵的Dinic #include #include #include #include #include using namespace std; #define MAXN 110 #define MAXM 1005 #d转载 2015-04-05 17:58:33 · 460 阅读 · 0 评论 -
poj1325 二分图的最小覆盖
如题:http://poj.org/problem?id=1325 Machine Schedule Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 12460 Accepted: 5329 Description As we all know, machi原创 2015-04-12 09:12:10 · 377 阅读 · 0 评论 -
poj2516 最小费用流
如题:http://poj.org/problem?id=2516 Minimum Cost Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 14338 Accepted: 4909 Description Dearboy, a goods victuale原创 2015-04-13 09:18:58 · 404 阅读 · 0 评论 -
poj3041 二分图最小顶点覆盖
如题:http://poj.org/problem?id=3041 Asteroids Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 16442 Accepted: 8967 Description Bessie wants to navigate her原创 2015-04-14 09:11:31 · 465 阅读 · 0 评论 -
最大流Dinic
#include #include #include #include #define min(a,b)(a #define INF 0x0fffffff using namespace std; #define MAX_V 1000 struct edge { int to,cap,rev; //rev代表反向边的to。G[e.to][e.rev] edge(){}原创 2015-04-01 10:41:51 · 385 阅读 · 0 评论