Matrix Decompressing

题意：
给一个矩阵的每行和每列的和,(给的是前i行或者列的和)，矩阵中每个元素的值在1到20之间,找出这样的一个矩阵。
算法：

对于S-Column边，其容量分别设置为相应各列之和，Row-T同理
中间各边容量设置为20
经过最大流求解，中间各边流量即是各元素之解
运用到最大流的“分配”，以及二分图的“对称分配”功能。
优化：解中会由于存在“0”流，不在0~20范围内。为解决此类问题， 将容量设为19、$C_i-R$$R_i-C$,结果再把1加回来

#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<vector>
#include<queue>
using namespace std;
const int maxn = 405, INF = 1000000;
int d[maxn][maxn];//

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;
    vector<Edge> edges;
    vector<int> G[maxn];
    int a[maxn];
    int p[maxn];

    void init(int n)
    {
        for (int i = 0; i < n; i++)
            G[i].clear();
        edges.clear();
    }
    void AddEdge(int u, int v, int c)
    {
        edges.push_back(Edge(u, v, c, 0));
        //edges.push_back(Edge(v, u, 0, 0));
        m = edges.size();
        G[u].push_back(m - 1);
        //G[v].push_back(m - 1);
    }
    void MaxFlow(int s, int t)
    {
        int flow = 0;
        for (;;)
        {
            memset(a, 0, sizeof(a));
            queue<int> Q;
            Q.push(s);
            a[s] = INF;
            while (!Q.empty())
            {
                int u = Q.front();
                Q.pop();
                for (int i = 0; i < G[u].size(); i++)
                {
                    Edge& e = edges[G[u][i]];
                    if (!a[e.to] && e.cap > e.flow)
                    {
                        a[e.to] = min(a[u], e.cap - e.flow);
                        Q.push(e.to);
                        p[e.to] = G[u][i];
                    }
                }
                if (a[t])
                    break;
            }
            if (!a[t])
                break;
            for (int i = t; i != s; i = edges[p[i]].from)
            {
                edges[p[i]].flow += a[t];
                //edges[p[i] ^ 1].flow -= a[t];
            }
            flow += a[t];
        }
        /*for (int i = 0; i < G[s].size(); i++)
        {
        Edge& e = edges[G[s][i]];
        int first = 1;
        for (int j = 0; j < G[e.to].size(); j++)
        {
        Edge& e1 = edges[G[e.to][j]];
        if (first)
        {
        cout << e1.flow + 1;
        first = 0;
        }
        cout << " " << e1.flow + 1;
        }
        cout << endl;
        }*/
        return;
    }
}E;
int main()
{
    int R, C, T, cnt = 0;
    cin >> T;
    while (T--)
    {
        cin >> R >> C;
        E.init(R + C + 2);
        for (int i = 1; i <= R; i++)
            for (int j = R + 1; j <= R + C; j++)
            {
                E.AddEdge(i, j, 19);
                d[i][j] = E.edges.size() - 1;
            }
        int temp = 0, temp1;
        for (int i = 1; i <= R; i++)
        {
            cin >> temp1;
            E.AddEdge(0, i, temp1 - temp - C);
            temp = temp1;
        }
        temp = 0;
        for (int j = R + 1; j <= R + C; j++)
        {
            cin >> temp1;
            E.AddEdge(j, R + C + 1, temp1 - temp - R);
            temp = temp1;
        }
        cout << "Matrix " << ++cnt << endl;
        E.MaxFlow(0, R + C + 1);
        for (int i = 1; i <= R; i++)
        {
            for (int j = R + 1; j <= R + C; j++)
                printf("%d ", E.edges[d[i][j]].flow + 1);
            cout << endl;
        }
        cout << endl;
    }
}