Drainage Ditches
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7563 Accepted Submission(s): 3559
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.
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 Input
5 4 1 2 40 1 4 20 2 4 20 2 3 30 3 4 10
Sample Output
50
Source
Recommend
lwg
这个题目是最大流的入门题目,感觉应该讲还是不错,最大流真的好神奇哎
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<queue>
using namespace std;
#define M 0x3f3f3f3f
int n,m,map[300][300],flow[300][300],p[300],a[300];
int EK_max_flow(int s,int t)
{
int sum=0;
int i,j;
queue<int>q;
memset(flow,0,sizeof(flow));
while(true)//当找不出其他增广路线
{
memset(a,0,sizeof(a));//记住残余水量
a[s]=M;
q.push(s);
while(!q.empty())
{
int u=q.front();
q.pop();
for(i=2;i<=m;i++)
{
if(!a[i]&&map[u][i]>flow[u][i])
{
p[i]=u;
q.push(i);
a[i]=a[u]<map[u][i]-flow[u][i]?a[u]:map[u][i]-flow[u][i];
}
}
}
if(!a[t])//为0时离开
break;
for(i=t;i!=s;i=p[i])
{
flow[p[i]][i]+=a[t];
flow[i][p[i]]-=a[t];
}
sum=sum+a[t];
}
return sum;
}
int main()
{
int i,j,k;
int a,b,c;
while(scanf("%d%d",&n,&m)!=EOF)
{
memset(map,0,sizeof(map));
memset(p,0,sizeof(p));//记住每个点的父类是谁
while(n--)
{
scanf("%d%d%d",&a,&b,&c);
map[a][b]=map[a][b]+c;
}
int max=EK_max_flow(1,m);
printf("%d\n",max);
}
}