示例题目: HDU3549
#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<algorithm>
#include<cstring>
using namespace std;
const int MAXN=20;//点数的最大值
const int MAXM=2005;//边数的最大值
const int INF=0x3f3f3f3f;
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 Edmonds_Karp
{
int n,m;
vector<Edge> edges;//边数的两倍
vector<int> G[MAXN];
//邻接表,G[i][j]表示结点i的第j条边在e数组中的序号
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,0,0));
m=edges.size();
G[from].push_back(m-2);
G[to].push_back(m-1);
}
int 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 x=Q.front();Q.pop();
int sz=G[x].size();
for(int i=0;i<sz;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(int 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;
}
};
Edmonds_Karp ek;
int main()
{
int T;
scanf("%d",&T);
int cas=0;
while(T--)
{
int n,m;
scanf("%d%d",&n,&m);
ek.init(n);
int u,v,w;
for(int i=1;i<=m;i++)
{
scanf("%d%d%d",&u,&v,&w);
ek.addEdge(u,v,w);
}
printf("Case %d: %d\n",++cas,ek.Maxflow(1,n));
}
return 0;
}