poj--1273(最大流基础题)
2016-01-23 16:48
239 查看
Drainage Ditches
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 Input
Sample Output
50
解体思路:这是我的第一道网络流,这是基础的最大流,推荐一篇文章关于最大流,通俗易懂http://www.cnblogs.com/ZJUT-jiangnan/p/3632525.html。
代码如下:
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 65643 | Accepted: 25340 |
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 Input
5 4 1 2 40 1 4 20 2 4 20 2 3 30 3 4 10
Sample Output
50
解体思路:这是我的第一道网络流,这是基础的最大流,推荐一篇文章关于最大流,通俗易懂http://www.cnblogs.com/ZJUT-jiangnan/p/3632525.html。
代码如下:
#include<stdio.h> #include<string.h> #include<queue> #define INF 0x3f3f3f3f using namespace std; int map[210][210],path[210],flow[210]; int n,m,star,end; queue<int>q; int bfs(){ int i,t; while(!q.empty())q.pop(); memset(path,-1,sizeof(path)); path[star]=0;flow[end]=INF; q.push(star); t=star; while(!q.empty()){ t=q.front(); q.pop(); if(t==end)break; for(i=1;i<=m;i++){ if(i!=star&&path[i]==-1&&map[t][i]){ flow[i]=flow[t]<map[t][i]?flow[t]:map[t][i]; q.push(i); path[i]=t; } } } if(path[end]==-1)return -1; return flow[end]; //一次遍历 之后的流量增量 } int Edmonds_Karp(){ int i,max_flow,step,now,per; max_flow+=step; while((step=bfs())!=-1){//不存在增广路则跳出 now=end; while(now!=star){ map[per][end]-=step; map[end][per]+=step; now=per; } } return max_flow; } int main(){ int i,u,v,cost; while(scanf("%d%d",&n,&m)!=EOF){ memset(map,0,sizeof(map)); for(i=0;i<n;i++){ scanf("%d%d%d",&u,&v,&cost); map[u][v]+=cost; } star=1;end=m; printf("%d\n",Edmonds_Karp()); } return 0; }
相关文章推荐
- 安装QT
- html页面通过特殊链接:打电话,发短信,发邮件详细教程
- python中numpy对函数进行矢量化转换
- Linux系统查看系统版本号的方法总结(包括Ubuntu,Redhat,CentOS)
- 【EF 3】浅谈ADO数据模型生成串(一):csdl,ssdl,msl分析
- java blockingqueque
- 数据结构之--图的讲解与C语言实现
- 【EF 2】浅谈ADO数据模型生成串(二):数据库连接串分析
- 【EF 2】浅谈ADO数据模型生成串(二):数据库连接串分析
- 【EF 3】浅谈ADO数据模型生成串(一):csdl,ssdl,msl分析
- asp.net 发送邮件
- JS实现省市联动
- hello world
- Linux修改挂载点
- iOS App设置icon,启动图,App名称的方法
- Android&Java的成长之路之一(java服务器搭建)
- 图像处理中色调、亮度、饱和度的定义
- 轻量级的Java 开发框架 Spring
- 后缀数组
- iis7运行php时出现FastCGI进程意外退出的解决方案