网络流
kidozh
这个作者很懒,什么都没留下…
展开
-
网络流standard model
//Edmondes-Karp#include #include #include #define INF 0x7fffffffusing namespace std;queue q;const int maxn = 200;int n, m, ans;int next[maxn+10], p[maxn+10], f[maxn+10][maxn+10], cap[maxn+10]原创 2014-09-06 23:56:07 · 446 阅读 · 0 评论 -
费用流!
DescriptionWhen 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 contains his house and the Nth of原创 2014-09-06 23:58:21 · 438 阅读 · 0 评论