UVA 11082 Matrix Decompressing（最大流）

题目地址：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2023

思路：首先求出每一行与每一列的和，对于每一行，想象一水流与m个格子，水总量为一行和，则水分别流入m个格子中。因此，每一列的和即为每一行的水流流入的每个格子中的水流总量。所以，设置一源点s，与每一行的和i连边，容量为该行和；设置一汇点t，与每一列的和j连边，容量为该列的和；对于每一个i、j，连一条边，容量为20，则该矩阵中的元素（i，j）的值即为边<i，j>的流量。但此时会有零出现，因此将每个元素减一，则s与i容量为该行和减m，j与t容量为该列和减n，边<i，j>容量为19，求最大流即可。最后元素值即为边<i，j>流量加一。

#include<map>
#include<cstdio>
#include<queue>
#include<vector>
#include<cstring>
#include<iostream>
#include<algorithm>
#define debu
using namespace std;
const int maxn=100+50;
const int INF=0x3f3f3f3f;
struct Edge
{
    int from, to, cap, flow;
    Edge(int a=0,int b=0,int c=0,int d=0):from(a),to(b),cap(c),flow(d) {}
};
struct Dinic
{
    int n, m, s, t;
    vector<Edge> edges;
    vector<int> G[maxn];
    bool vis[maxn];
    int d[maxn];
    int cur[maxn];
    void init(int n)
    {
        this->n=n;
        for(int i = 0; i < n; i++) G[i].clear();
        edges.clear();
    }
    void addedge(int from, int to, int cap)
    {
        edges.push_back(Edge(from,to,cap,0));
        edges.push_back(Edge(to,from,0,0));
        int m = edges.size();
        G[from].push_back(m-2);
        G[to].push_back(m-1);
    }
    bool BFS()
    {
        memset(vis, 0, sizeof(vis));
        queue<int> Q;
        Q.push(s);
        vis[s] = 1;
        d[s] = 0;
        while(!Q.empty())
        {
            int x = Q.front();
            Q.pop();
            for(int i = 0; i < G[x].size(); i++)
            {
                Edge& e = edges[G[x][i]];
                if(!vis[e.to] && e.cap > e.flow)
                {
                    vis[e.to] = 1;
                    d[e.to] = d[x] + 1;
                    Q.push(e.to);
                }
            }
        }
        return vis[t];
    }
    int DFS(int x, int a)
    {
        if(x == t || a == 0) return a;
        int flow = 0, f;
        for(int& i = cur[x]; i < G[x].size(); i++)
        {
            Edge& e = edges[G[x][i]];
            if(d[x] + 1 == d[e.to] && (f = DFS(e.to, min(a, e.cap-e.flow))) > 0)
            {
                e.flow += f;
                edges[G[x][i]^1].flow -= f;
                flow += f;
                a -= f;
                if(a == 0) break;
            }
        }
        return flow;
    }
    int Maxflow(int s, int t)
    {
        this->s = s;
        this->t = t;
        int flow = 0;
        while(BFS())
        {
            memset(cur, 0, sizeof(cur));
            flow += DFS(s, INF);
        }
        return flow;
    }
};
int n,m;
Dinic G;
int r[maxn],c[maxn];
int ans[maxn][maxn];
int sumr[maxn],sumc[maxn];
int main()
{
#ifdef debug
    freopen("in.in","r",stdin);
#endif // debug
    int t,cas=0;
    scanf("%d",&t);
    while(t--)
    {
        cas++;
        if(cas!=1) printf("\n");
        printf("Matrix %d\n",cas);
        scanf("%d%d",&n,&m);
        for(int i=0; i<n; i++)
        {
            scanf("%d",&sumr[i]);
            if(!i) r[i]=sumr[i]-m;
            else r[i]=sumr[i]-sumr[i-1]-m;
        }
        for(int i=0; i<m; i++)
        {
            scanf("%d",&sumc[i]);
            if(!i) c[i]=sumc[i]-n;
            else c[i]=sumc[i]-sumc[i-1]-n;
        }
        G.init(n+m+2);
        for(int i=1; i<=n; i++)
            G.addedge(0,i,r[i-1]);
        for(int i=1; i<=m; i++)
            G.addedge(n+i,n+m+1,c[i-1]);
        for(int i=1; i<=n; i++)
        {
            for(int j=1; j<=m; j++)
                {
                    G.addedge(i,n+j,19);
                    ans[i][j]=G.edges.size()-2;
                }
        }
        G.Maxflow(0,n+m+1);
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                if(j==1) printf("%d",G.edges[ans[i][j]].flow+1);
                else printf(" %d",G.edges[ans[i][j]].flow+1);
            }
            printf("\n");
        }
    }
    return 0;
}