poj2195 费用流

题意： 给你一个 N∗M​ 的地图，上面有房子”H”,人“m”,空地“.”。房子和人数相同，将人移动一格花费为1，问将将地图变为一个房子上恰好一人的最小花费

题解：超级源点与人建边 容量为一 费用为零 ， 超级汇点与房子建边容量为一 费用为零， 其他连接的两点之间容量为无穷 费用为一， 地图左上角为一号点 右下为N*M 

#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<map>
using namespace std;
const int inf = 0x7fffffff;
const int maxn = 1e5+5;
int N,M;
char grid[105][105];
int dis[maxn];
int vis[maxn];
int pre[maxn];
struct Edge{
    int u,v;
    int cap,cost,next;
}edge[maxn*4];
int edgecount;
int head[maxn];
void Init(){
    memset(head,-1,sizeof(head));
    edgecount=0;
}
void Add_edge(int u,int v,int cap,int cost) {
    edge[edgecount].u=u;
    edge[edgecount].v=v;edge[edgecount].cap=cap;
    edge[edgecount].cost=cost;edge[edgecount].next=head[u];
    head[u]=edgecount++;
    edge[edgecount].u=v;
    edge[edgecount].v=u;edge[edgecount].cap=0;
    edge[edgecount].cost=-cost;edge[edgecount].next=head[v];
    head[v]=edgecount++;
}
bool spfa(int s,int t,int n) {//return 0 表示没有增广路
    for(int i=0;i<=n;i++) {
        dis[i]=inf;
        vis[i]=0;
        pre[i]=-1;
    }
    dis[s]=0;
    vis[s]=1;
    queue<int> Q;
    Q.push(s);
    while(!Q.empty()) {
        int u=Q.front();
        Q.pop();
        vis[u]=0;
        for(int k=head[u];k!=-1;k=edge[k].next) {
            int v=edge[k].v;
            int cost=edge[k].cost;
            if(edge[k].cap && dis[v]>dis[u]+cost) {
                dis[v]=dis[u]+cost;
                pre[v]=k;
                if(!vis[v]) {
                    vis[v]=1;
                    Q.push(v);
                }
            }
        }
    }
    if(dis[t]==inf)return 0;
    return 1;
}
void MCMF(int s,int t,int n) {
    int minflow;
    int mincost=0;
    while(spfa(s,t,n)) {
        minflow=inf;
        for(int k=pre[t];k!=-1;k=pre[edge[k].u]) {
            minflow = min(minflow,edge[k].cap);
        }
        for(int k=pre[t];k!=-1;k=pre[edge[k].u]) {
            edge[k].cap-=minflow;
            edge[k^1].cap+=minflow;
        }
        mincost+=dis[t];
    }
    printf("%d\n",mincost);
}
int get_num(int i,int j) {
    return (i-1)*M+j;
}
bool is_out(int x,int y) {
    if(x<1 || x>N || y<1 || y>M) {
        return 1;
    }
    return 0;
}
void Build() {
    for(int i=1;i<=N;i++) {
        for(int j=1;j<=M;j++) {
            if(!is_out(i-1,j))Add_edge(get_num(i,j),get_num(i-1,j),inf,1);
            if(!is_out(i+1,j))Add_edge(get_num(i,j),get_num(i+1,j),inf,1);
            if(!is_out(i,j-1))Add_edge(get_num(i,j),get_num(i,j-1),inf,1);
            if(!is_out(i,j+1))Add_edge(get_num(i,j),get_num(i,j+1),inf,1);
            if(grid[i][j]=='m')Add_edge(0,get_num(i,j),1,0);
            else if(grid[i][j]=='H')Add_edge(get_num(i,j),N*M+1,1,0);

        }
    }
}
int main(){
    while(~scanf("%d%d",&N,&M)) {
        if(N==0&&M==0) break;
        for(int i=1;i<=N;i++) {
            for(int j=1;j<=M;j++) {
                scanf("%c",&grid[i][j]);
                while(grid[i][j]==' ' || grid[i][j]=='\n') scanf("%c",&grid[i][j]);

            }
        }
        Init();
        Build();
        MCMF(0,N*M+1,N*M+2);
    }
}