题目 https://cn.vjudge.net/problem/UVA-820
题意
最大流裸题
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2100;
int s,t;//源点和汇点
int cnt;//边的数量,从0开始编号。
int Head[maxn];//每一个点最后一条边的编号
struct node
{
int u,v,w,next;
}edge[maxn];
int Depth[maxn];//分层图中标记深度
int n,m;
void Add(int u,int v,int w)
{
cnt++;
edge[cnt].u = u;
edge[cnt].v=v;
edge[cnt].w = w;
edge[cnt].next = Head[u];
Head[u] = cnt;
}
void Add_edge(int u,int v,int w)
{
Add(u,v,w); //双向图
Add(v,u,0);
}
int dfs(int u,int dist)
{
if(u == t)
return dist;
for(int i = Head[u];i!=-1;i=edge[i].next)
{
int v = edge[i].v;
int w = edge[i].w;
if((Depth[v] == Depth[u]+1)&&w !=0)//层数是当前层数加一流量不为0
{
int di = dfs(v,min(dist,w));
if(di > 0)
{
edge[i].w -= di;
edge[i^1].w += di;
return di;
}
}
}
return 0;
}
bool bfs()
{
queue<int> q;
while(!q.empty()) q.pop();
memset(Depth,0,sizeof(Depth));
Depth[s] = 1;
q.push(s);
do
{
int u = q.front();
q.pop();
for(int i = Head[u];i!=-1;i = edge[i].next)
{
int v = edge[i].v;
int w = edge[i].w;
if((w>0)&&Depth[v] == 0) //存在容量 并且没被访问
{
Depth[v] = Depth[u] + 1; // 层数加一
q.push(v);
}
}
}
while(!q.empty());
if(Depth[t] == 0) return 0;
else return 1;
}
int Dinic()
{
int Ans = 0;
while(bfs()) //建立分层图
{
// cout<<"YES"<<endl;
while(int d = dfs(s,0x3f3f3f3f)) //增广
Ans += d;
}
return Ans;
}
int main()
{
int i,j,k;
int u,v,w;
int tt = 1;
while(scanf("%d",&m) != EOF&&m)
{
scanf("%d %d %d",&s, &t, &n);
cnt=-1; //初始化边的编号
memset(Head,-1,sizeof(Head));
for(i=0;i<n;i++ ) //建图
{
scanf("%d%d%d",&u,&v,&w);
Add_edge(u,v,w);
Add_edge(v,u,w);
}
// s = 1; // 起点终点
// t = m;
int ans = Dinic();
printf("Network %d\n",tt++);
printf("The bandwidth is ");
printf("%d.\n\n",ans);
}
return 0;
}