POJ 2175 Evacuation Plan（费用流消负环）

大意：给出N个建筑物的坐标和里面的人数。给出M个防空洞的坐标和能容纳的人数。一个人的花费定义为从他的建筑物到目标防空洞的曼哈顿距离再加1。现在有人已经设计了一个避难方案。要你判断他给出的方案是否是所有人花费最少的解决方案，如果不是，请给出一个花费更小的解决方案（不必是最优）。

思路：我们可以把，负环中的所有点找到，然后跑费用流，输出残余网络。

#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<map>
#include<queue>
#define inf 0x3f3f3f3f
#define LL __int64
using namespace std;
const int N = 25100;
const int MI = -1;
struct node{
    int x,y,num;
}B[110],S[110];
struct N{
    int to,next,w,c;
}q[10010*10];
int cap[710][710],cost[710][710],cnt,st,ed,dis[21100],sum[21710],ti[21710],cur[21710],n;
bool vis[21000];
int spfa(){
    memset(vis,false,sizeof(vis));
    memset(dis,inf,sizeof(dis));
    memset(ti,0,sizeof(ti));
    memset(cur,-1,sizeof(cur));
    queue<int>Q;
    while(!Q.empty())
        Q.pop();

    Q.push(ed);
    ti[ed] = 1;
    dis[ed] = 0;
    while(!Q.empty()){
        int u = Q.front();
        Q.pop();
        vis[u] = false;
        for(int i = 0;i <= ed;++ i ){
            if(cap[u][i]&&dis[i] > dis[u] + cost[u][i] ){
                dis[i]  = dis[u] + cost[u][i] ;
                cur[i] = u;
                if(!vis[i]){
                    vis[i] = true;
                    Q.push(i);
                    ti[i]++;
                    if(ti[i] > ed)
                        return i;
                }
            }
        }
    }
    return MI;
}

int Dis(int a,int b){
    return abs(B[a].x-S[b].x)+abs(B[a].y-S[b].y);
}

int main(){
    int m,i,j,k;
    while(~scanf("%d%d",&n,&m)){
        memset(cap,0,sizeof(cap));
        memset(sum,0,sizeof(sum));
        memset(cost,0,sizeof(cost));
        for(i = 1;i <= n;++i)
            scanf("%d%d%d",&B[i].x,&B[i].y,&B[i].num);
        for(i = 1;i <= m;++i)
            scanf("%d%d%d",&S[i].x,&S[i].y,&S[i].num);
        for(i = 1;i <= n;++ i)
            for(j = 1;j <= m;++ j){
                int tmp =  Dis(i,j)+1;

                cost[i][j+n] = tmp;
                cost[j+n][i] = -tmp;
                cap[i][j+n] = B[i].num;
            }

        for(i = 1;i <= n;++ i)
            for(j = 1;j <= m;++ j){
                scanf("%d",&k);
                cap[i][j+n] -= k;
                //cout<<cap[i][j+n]<<"***"<<endl;
                cap[j+n][i] = k;
                sum[j] += k;
            }

        st = 0,ed = n+m+1;
        for(i = 1;i <= m;++ i){
            cap[i+n][ed] = S[i].num - sum[i];
            cap[ed][i+n] = sum[i];
        }
        int tmp = spfa();
        if(tmp == MI){
            puts("OPTIMAL");
            continue;
        }
        puts("SUBOPTIMAL");
        int u = tmp;
        for(i = 0;i <= ed;++ i)
            vis[i] = false;
        while(!vis[u]){
            vis[u] = true;
            u = cur[u];
        }
        tmp = u;

        do{
            cap[cur[u] ][u]--;
            cap[u][cur[u] ]++;
            u = cur[u];
        }while(u != tmp);
        for(i = 1;i <= n;++ i){
            for(j = 1;j <= m;++ j){
                printf(j!=1?" %d":"%d",cap[j+n][i]);
            }
            puts("");
        }
    }
    return 0;
}