随笔分类 -  图论--网络流

Dining POJ - 3281(最大流)
摘要：Dining Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 25452 Accepted: 11183 Description Cows are such finicky eaters. Each cow has a prefe 阅读全文
posted @ 2019-07-26 18:39 千摆渡Qbd 阅读(160) 评论(0) 推荐(0)
poj - 3436 ACM Computer Factory（最大流+打印路径）
摘要：ACM Computer Factory Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10687 Accepted: 3986 Special Judge Description As you know, all the co 阅读全文
posted @ 2019-07-25 00:58 千摆渡Qbd 阅读(180) 评论(0) 推荐(0)
最大流问题的几种经典解法
该文被密码保护。
posted @ 2019-07-23 20:25 千摆渡Qbd 阅读(2) 评论(0) 推荐(0)
Gym - 101908G Gasoline 二分+最大流
摘要：G - Gasoline Gym - 101908G #include<cstdio> #include<iostream> #include<algorithm> #include<cstring> #include<sstream> #include<cmath> #include<stack> 阅读全文
posted @ 2019-01-21 09:49 千摆渡Qbd 阅读(214) 评论(0) 推荐(0)
Farm Tour POJ - 2135 （最小费用流）
摘要：When FJ's friends visit him on the farm, he likes to show them around. His farm comprises N (1 <= N <= 1000) fields numbered 1..N, the first of which 阅读全文
posted @ 2019-01-20 18:00 千摆渡Qbd 阅读(131) 评论(0) 推荐(0)
Flow Problem HDU - 3549
摘要：Flow Problem HDU - 3549 Network flow is a well-known difficult problem for ACMers. Given a graph, your task is to find out the maximum flow for the we 阅读全文
posted @ 2019-01-20 17:58 千摆渡Qbd 阅读(164) 评论(0) 推荐(0)