uva820（最大流）

#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>

using namespace std;
const int maxn = 10000 + 5;
const int INF = 1e8;

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];			//当起点到i的可改进量
    int p[maxn]; 			//最短路上p的入弧编号

    void init(int 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,cap,0));//反向弧
        m = edges.size();
        G[from].push_back(m-2);
        G[to].push_back(m-1);//G[i][j]表示节点i的第j条边在e数组的序号
    }

    int Maxflow(int s,int t){
        int flow=0;
        for(;;){
            memset(a,0,sizeof(a));