POJ 2112 Optimal Milking（最大流 + 二分 + Floyd）

这道题也做了好久

首先很容易想到的是通过二分查找最大值，然而还是不会二分，但是这次多了一个模板

没想到的是可以通过Floyd进行路径优化使得所有路径是最短路，这点没有发现，对于路径问题还是不够敏感

最后需要注意作图的严谨性，一定要在纸上归纳清楚了再下手，这次源点和汇点连错了，结果天差地别，de了半天的bug

加油?

http://poj.org/problem?id=2112

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define ll long long
#define mod 1000000007
#define inf 0x3f3f3f3f
using namespace std;
const int maxn = 255;
int cnt, st, en;
int n, m, k;
int u, v, w;
struct node
{
    int to, next, w;
}e[maxn*maxn];
int path[maxn][maxn];
int head[maxn], depth[maxn], cur[maxn];
void init()
{
    st = 0, en = n + m + 1;
    cnt = 0;
    memset(head, -1, sizeof(head));
}
void addedge(int u, int v, int w)
{
    e[cnt].w = w;
    e[cnt].to = v;
    e[cnt].next = head[u];
    head[u] = cnt ++;

    e[cnt].w = 0;
    e[cnt].to = u;
    e[cnt].next = head[v];
    head[v] = cnt ++;
}
int dfs(int u, int flow)
{
    if(u == en) return flow;
    for(int& i = cur[u]; ~i; i = e[i].next)
    {
        if(depth[e[i].to] == depth[u] + 1 && (e[i].w != 0))
        {
            int zen = dfs(e[i].to, min(e[i].w, flow));
            if(zen)
            {
                e[i].w -= zen;
                e[i^1].w += zen;
                return zen;
            }
        }
    }
    return 0;
}
int bfs()
{
    queue<int> q;
    while(! q.empty()) q.pop();
    memset(depth, 0, sizeof(depth));
    depth[st] = 1;
    q.push(st);
    while(! q.empty())
    {
        int h = q.front();
        q.pop();
        for(int i = head[h]; ~i; i = e[i].next)
        {
            if((! depth[e[i].to]) && e[i].w)
            {
                depth[e[i].to] = depth[h] + 1;
                q.push(e[i].to);
            }
        }
    }
    if(depth[en]) return 1;
    return 0;
}
int dinic()
{
    int ans = 0;
    while(bfs())
    {
        for(int i = 0; i <= n + m + 1; i ++)
            cur[i] = head[i];
        while(int d = dfs(st, inf))
            ans += d;
    }
    return ans;
}
int main()
{
    int flow;
    while(scanf("%d%d%d", &n, &m, &flow) != EOF)
    {
        for(int i = 1; i <= n + m; i ++)
            for(int j = 1; j <= n + m; j ++)
            {
                scanf("%d", &path[i][j]);
                if(i != j && ! path[i][j])
                    path[i][j] = inf;
            }
        for(int k = 1; k <= n + m; k ++)
            for(int i = 1; i <= n + m; i ++)
                for(int j = 1; j <= n + m; j ++)
                    if(path[i][j] > path[i][k] + path[k][j])
                        path[i][j] = path[i][k] + path[k][j];
        int l = 0, r = inf, mid;
        while(l <= r)
        {
            //cout<<1<<endl;
            mid = (l + r) / 2;
            init();
            for(int i = 1; i <= n; i ++)
                for(int j = n + 1; j <= n + m; j ++)
                    if(path[i][j] <= mid)
                addedge(j - n, i + m, 1);
            for(int i = 1; i <= n; i ++)
                addedge(i + m, n + m + 1, flow);
            for(int i = 1; i <= m; i ++)
                addedge(0, i, 1);
            int ans = dinic();
            if(ans == m)
                r = mid - 1;
            else l = mid + 1;
        }
        printf("%d\n", l);
    }
    return 0;
}