紫书例题11-8（最大流）

<span style="font-size:18px;">#include <iostream>
#include <vector>
#include <queue>
#include <cstring>
using namespace std;
const int maxn=45,INF=1000000000;

struct Edge
{
    int from,to,cap,flow;
    Edge(int u,int v,int c,int f):from(u),to(v),cap(c),flow(f){}
};

struct EdmondsKarp
{
    int n,m,i;
    vector<Edge> edges;
    vector<int> G[maxn];
    int a[maxn];
    int p[maxn];

    void init(int n)
    {
        for(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));
        m=edges.size();
        G[from].push_back(m-2);
        G[to].push_back(m-1);
    }

    void Maxflow(int s,int t)
    {
        int flow=0,u;
        for(;;)
        {
            memset(a,0,sizeof(a));
            queue<int> Q;
            Q.push(s);
            a[s]=INF;
            while(!Q.empty())
            {
                int x=Q.front();
                Q.pop();
                for(i=0;i<G[x].size();i++)
                {
                    Edge& e=edges[G[x][i]];
                    if(!a[e.to]&&e.cap>e.flow)
                    {
                        p[e.to]=G[x][i];
                        a[e.to]=min(a[x],e.cap-e.flow);
                        Q.push(e.to);
                    }
                }
                if(a[t])break;
            }
            if(!a[t])break;
            for(u=t;u!=s;u=edges[p[u]].from)
            {
                edges[p[u]].flow+=a[t];
                edges[p[u]^1].flow-=a[t];
            }
            flow+=a[t];
        }
        //return flow;
    }
};

int main()
{
    EdmondsKarp ans;
    int T,r,c,i,rx[25],ry[25],x[25],y[25],j,kase=1;
    cin>>T;
    while(T--)
    {
        ans.init(44);
        cin>>r>>c>>rx[1];
        x[1]=rx[1];
        ans.AddEdge(0,1,rx[1]-c);
        for(i=2;i<=r;i++)
        {
            cin>>x[i];
            rx[i]=x[i]-x[i-1]-c;
            ans.AddEdge(0,i,rx[i]);
        }
        cin>>ry[1];
        y[1]=ry[1];
        ans.AddEdge(r+1,41,ry[1]-r);
        for(i=2;i<=c;i++)
        {
            cin>>y[i];
            ry[i]=y[i]-y[i-1]-r;
            ans.AddEdge(r+i,41,ry[i]);
        }
        for(i=1;i<=r;i++)
            for(j=r+1;j<=r+c;j++)
                ans.AddEdge(i,j,19);
        ans.Maxflow(0,41);
        cout<<"Matrix "<<kase++<<endl;

        for(i=1;i<=r;i++)
        {
            for(j=1;j<=c;j++){cout<<ans.edges[ans.G[i][j]].flow+1<<" ";}
            cout<<endl;
        }
        cout<<endl;
    }
    return 0;
}
</span>