dinic算法 java_hdu 3549--Drainage Ditches(最大流：Dinic算法)

Drainage Ditches

Problem Description

Every

time it rains on Farmer John's fields, a pond forms over Bessie's

favorite clover patch. This means that the clover is covered by water

for awhile and takes quite a long time to regrow. Thus, Farmer John has

built a set of drainage ditches so that Bessie's clover patch is never

covered in water. Instead, the water is drained to a nearby stream.

Being an ace engineer, Farmer John has also installed regulators at the

beginning of each ditch, so he can control at what rate water flows into

that ditch.

Farmer John knows not only how many gallons of water

each ditch can transport per minute but also the exact layout of the

ditches, which feed out of the pond and into each other and stream in a

potentially complex network.

Given all this information, determine

the maximum rate at which water can be transported out of the pond and

into the stream. For any given ditch, water flows in only one direction,

but there might be a way that water can flow in a circle.

Input

The

input includes several cases. For each case, the first line contains

two space-separated integers, N (0 <= N <= 200) and M (2 <= M

<= 200). N is the number of ditches that Farmer John has dug. M is

the number of intersections points for those ditches. Intersection 1 is

the pond. Intersection point M is the stream. Each of the following N

lines contains three integers, Si, Ei, and Ci. Si and Ei (1 <= Si, Ei

<= M) designate the intersections between which this ditch flows.

Water will flow through this ditch from Si to Ei. Ci (0 <= Ci <=

10,000,000) is the maximum rate at which water will flow through the

ditch.

Output

For each case, output a single integer, the maximum rate at which water may emptied from the pond.

Sample Input5 4

1 2 40

1 4 20

2 4 20

2 3 30

3 4 10

Sample Output

Case 1: 1

Case 2: 2

题意：

给出n条边,m个点，给出每条边的流量，求结点1到n的最大流。

题解：

裸的最大流算法。写写注释，用来存模板。

#include

#include

#include

#include

#include

#include

#include

#include

#include

#include

#include

#define inf 0x3f3f3f3f

#define ll long long

#define sscc ios::sync_with_stdio(false);

#define ms(a) memset(a,0,sizeof(a))

#define mss(a) memset(a,-1,sizeof(a))

#define msi(a) memset(a,inf,sizeof(a))

using namespace std;

const int M=1000+5;

const int N= 100+5;

struct A{

int y,len,next;

}a[M*2];

int pre[N],cent=0;

int ce[N];

int q[N];

int be,en;

void add(int x,int y,int z)//前向星{

a[cent].y=y,a[cent].len=z,a[cent].next=pre[x];

pre[x]=cent++;

}

bool bfs()//寻找增广路(也就是可以从起点走到终点，且len>0){

ms(ce);

ce[be]=1;//初始化编号

int l=0,r=1;//队列

q[r]=be;//队列

while(l

{

int u=q[++l];//出队

for(int i=pre[u];~i;i=a[i].next)//遍历边

{

int v=a[i].y;

if(!ce[v]&&a[i].len)//这个点没走过、长度大于 0

ce[v]=ce[u]+1,q[++r]=v;//编号、进队

}

}

return ce[en];

}

int dfs(int u,int mi){

int ans=0;

if(mi==0||u==en)return mi;//流量为0、到达终点，返回

for(int i=pre[u];~i;i=a[i].next)

{

int v=a[i].y;

if(ce[u]+1==ce[v]&&a[i].len)//编号满足条件、且长度大于 0

{

int minn=dfs(v,min(mi-ans,a[i].len));//找最小值 (-ans很重要)

a[i].len-=minn;//边的长度 -

a[i^1].len+=minn;//反向边长度 +

ans+=minn; //统计流量

if(ans==mi)

return ans;

}

}

return ans;

}

int dinic(int x,int y){

be=x,en=y;//起点、终点

int ans=0;

while(bfs())

{

ans+=dfs(be,inf);//累加

}

return ans;

}

int main(){

int t,n,m,poit=0;

scanf("%d",&t);

while(t--)

{

mss(pre);

cent=0;

scanf("%d%d",&n,&m);//点数量、边数量

for(int i=0;i

int x,y,z;

scanf("%d%d%d",&x,&y,&z);

add(x,y,z);//正边 z长度流

add(y,x,0);//反边 0长度流

}

int ans=dinic(1,n);

printf("Case %d: %d\n",++poit,ans);

}

return 0;

}