POJ 2391 网络流最大流

首先想到floyd,然后二分最大距离加边，但是会有问题 如果1->3 距离110 1->2距离40 2 ->3距离70 ,当最大距离是70时1->3仍然可走,所以需要拆点.

把每个点拆成一个来源一个去向然后来源和去向连一条无穷的边

 

#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <stack>
#include <string>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;

typedef  long long LL;
const double PI = acos(-1.0);

template <class T> inline  T MAX(T a, T b){if (a > b) return a;return b;}
template <class T> inline  T MIN(T a, T b){if (a < b) return a;return b;}

const int N = 444;
const int M = 41111;
const LL MOD = 1000000007LL;
const int dir[4][2] = {1, 0, -1, 0, 0, -1, 0, 1};
const int INF = 0x3f3f3f3f;
const LL LINF = 99999999999999LL;

struct arclist {
    struct edge{int v, cap, next;} E[N + M << 1];
    int head[N], cur;
    inline void init()
    {
        memset(head, -1, sizeof(head)); cur = 0;
    }
    inline void add(int u, int v, int cap = 1) {
        E[cur].v = v; E[cur].cap = cap;
        E[cur].next = head[u]; head[u] = cur++;
        E[cur].v = u; E[cur].cap = 0;
        E[cur].next = head[v]; head[v] = cur++;
    }
    int SAP(int S, int T, int n)
    {
        int maxflow = 0, pre[N], dis[N] = {}, gap[N] = {};
        int cur[N]; memcpy(cur, head, sizeof(cur));
        gap[0] = n + 1; ++gap[dis[S] = 1];
        for (int u = pre[S] = S; dis[S] <= n; ++gap[++dis[u]], u = pre[u])
        {
            for (bool flag = true; flag;)
            {
                flag = false;
                for (int &p = cur[u]; ~p; p = E[p].next)
                {
                    if (!E[p].cap || dis[u] != dis[E[p].v] + 1) continue;
                    flag = true; pre[E[p].v] = u; u = E[p].v;
                    if (u == T)
                    {
                        int aug = INF;
                        for (int i = S; i != T; i = E[cur[i]].v)
                            if (aug > E[cur[i]].cap)
                            {
                                u = i; aug = E[cur[i]].cap;
                            }
                        for (int i = S; i != T; i = E[cur[i]].v)
                        {
                            E[cur[i]].cap -= aug;
                            E[cur[i] ^ 1].cap += aug;
                        }
                        maxflow += aug;
                    }
                    break;
                }

            }
            if (--gap[dis[u]] == 0) break;
            dis[u] = n;
            for (int p = head[u]; ~p; p = E[p].next)
                if (E[p].cap && dis[u] > dis[E[p].v]) {dis[u] = dis[E[p].v]; cur[u] = p;}
        }
        return maxflow;
    }
}flow;

int f[222], c[222];
LL grid[222][222];


int main()
{
    int F, P;
    while (scanf("%d%d", &F, &P) != EOF)
    {
        int tag = 0, i, j, k, w, u, v;
        for (i = 1; i <= F; ++i)
        {
            for (j = 1; j <= F; ++j)
                if (i != j) grid[i][j] = LINF;
                else grid[i][j] = 0;
        }
        for (i = 1; i <= F; ++i)
        {
            scanf("%d %d", &f[i], &c[i]);
            tag+=f[i];
        }
        for (i = 0; i < P; ++i)
        {
            scanf("%d%d%d", &u, &v, &w);
            if (grid[u][v] > w) grid[u][v] = grid[v][u] = w;

        }
        for (k = 1; k <= F; ++k)
            for (i = 1; i <= F; ++i)
                for (j = 1; j <= F; ++j)
                {
                    if (grid[i][k] + grid[k][j] < grid[i][j])
                        grid[i][j] = grid[i][k] + grid[k][j];
                }
        LL mx = 0, ans, mid, l, r;
        l = 0;
        for (i = 1; i <= F; ++i)
            for (j = 1; j <= F; ++j)
                if (grid[i][j] != LINF) mx = MAX(mx, grid[i][j]);
        r = mx; ans = -1;
        while (l <= r)
        {
//            printf("%I64d  %I64d\n", l, r);
            mid = (l + r) >> 1;
            flow.init();
            for (i = 1; i <= F; ++i)
                flow.add(0, i * 2 - 1, f[i]);
            for (i = 1; i <= F; ++i)
                flow.add(i * 2, F * 2 + 1, c[i]);
            for (i = 1; i <= F; ++i)
                flow.add(i * 2 - 1, i * 2, INF);
            for (i = 1; i <= F; ++i)
                for (j = 1; j <= F; ++j)
                {
                    if (grid[i][j] > mid) continue;
                    flow.add(i * 2 - 1, j * 2, INF);

                }
            int res = flow.SAP(0, F * 2 + 1,  F * 2 + 2);
            if (res == tag) {ans = mid; r = mid - 1;}
            else l = mid + 1;
        }
        printf("%I64d\n", ans);
    }
    return 0;
}