![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM_网络流
文章平均质量分 74
**:天下第一
这个作者很懒,什么都没留下…
展开
-
【POJ1459】Power Network
【题目】http://poj.org/problem?id=1459Power NetworkTime Limit: 2000MS Memory Limit: 32768KTotal Submissions: 23873 Accepted: 12456DescriptionA power network consi原创 2015-02-10 20:20:25 · 363 阅读 · 0 评论 -
【POJ2516】【最小费用流】
Minimum CostTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 15057 Accepted: 5176DescriptionDearboy, a goods victualer, now comes to a big problem, and原创 2015-09-11 21:46:56 · 289 阅读 · 0 评论 -
【HDU4280】【最大流模板题】
Island TransportTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 6668 Accepted Submission(s): 2091Problem Description In th原创 2015-09-11 19:25:23 · 444 阅读 · 0 评论 -
【HDU4292】【1的限制建图】
FoodTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4105 Accepted Submission(s): 1365Problem Description You, a part-time di原创 2015-09-11 18:48:20 · 313 阅读 · 0 评论 -
【求割边】
Max_Flow MF;int n,m;int main(){ while(scanf("%d%d",&n,&m) != EOF) { if(n == 0 && m == 0) break; MF.Init(n+5,1,n); int u,v,w; for(int i=0;i<m;i++) { scanf("%d%d%d",&u,&v,&w); MF转载 2015-09-12 00:09:50 · 348 阅读 · 0 评论 -
【最小费用流】【模板】
int sumFlow;const int MAXN = 1010;const int MAXM = 1000200;const int INF = 1000000000;struct Edge{ int u, v, cap, cost; int next;}edge[MAXM<<2];int NE;int head[MAXN], dist[MAXN], pp[MA原创 2015-09-11 20:51:57 · 337 阅读 · 0 评论 -
【无源汇的上下界网络流】【模板】
上界改容量,下界先流走。 U -> V之间添加一条 cap - down的边S->U 为U多出来的入的下界- 出的下界V -> T 为V多出来的出的下界-入的下界Max_Flow MF;int n,m;const int maxn = 210;const int maxm = 40010;int a[maxn];int id[maxm];int up[maxm]原创 2015-09-12 11:01:41 · 645 阅读 · 0 评论 -
【HDU2732】【点限制】【最大流】
Leapin' LizardsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1752 Accepted Submission(s): 717Problem DescriptionYour platoo原创 2015-09-12 09:18:03 · 366 阅读 · 0 评论 -
【POJ1459】【最大流】【EK】
Power NetworkTime Limit: 2000MS Memory Limit: 32768KTotal Submissions: 25417 Accepted: 13249DescriptionA power network consists of nodes (power stations, consum原创 2015-09-09 10:22:00 · 324 阅读 · 0 评论 -
【POJ3281】【最大流】【加边限制流量】
DiningTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 11698 Accepted: 5376DescriptionCows are such finicky eaters. Each cow has a preference for certa原创 2015-09-09 10:59:18 · 319 阅读 · 0 评论 -
【POJ1087】【最大流建模】
A Plug for UNIXTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14960 Accepted: 5062DescriptionYou are in charge of setting up the press room for the i原创 2015-09-09 13:29:47 · 393 阅读 · 0 评论 -
【POJ-1273】Drainage Ditches
#include #include #include #include using namespace std;const int maxn = 210;int N,M;int g[maxn][maxn];int pre[maxn];int cap[maxn];int used[maxn];const int INF = 0x3f3f3f3f;int EK(){原创 2015-02-10 16:37:05 · 448 阅读 · 0 评论 -
【HDU4289】
int n,m; Max_Flow MF;int main(){ freopen("in.txt","r",stdin); //freopen("out.txt","w",stdout); while(scanf("%d%d",&n,&m) != EOF) { int S,T; scanf("%d%d",&S,&T); MF.Init(2*n+2,S,T原创 2015-09-11 22:41:40 · 397 阅读 · 0 评论