HDU-1532(网络最大流)
来源:互联网 发布:cf卡海豹突击队软件 编辑:程序博客网 时间:2024/06/05 22:34
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.
5 41 2 401 4 202 4 202 3 303 4 10
50
/* * 题意: 给你n条边和m个点,问你1-m的网络最大流是多少? 题解: EK(Edmond—Karp)算法 */#include <queue> #include<string.h> #include<iostream>using namespace std;#define INF 0x3f3f3f3fint mp[205][205]; //记录残留网络的容量 int flow[205]; //标记从源点到当前节点实际还剩多少流量可用 int pre[205]; //标记在这条路径上当前节点的前驱,同时标记该节点是否在队列中 queue<int>Q;int n, m;int BFS(int Start, int End){while (!Q.empty()){Q.pop();}//初始化前置点for (int i = 1; i <= m; i++){pre[i] = -1;}pre[Start] = 0;flow[Start] = INF; //初始的时候最大流设置为无限大Q.push(Start);while (!Q.empty()){int Index = Q.front();Q.pop();if (Index == End){break;}for (int i = 1; i <= n; i++){//如果当前剩余流量大于0,并且之前没有访问过该点if (i != Start && mp[Index][i] > 0 && pre[i] == -1){pre[i] = Index; //当前点的前置是Index//更新源点到i点剩余的流量flow[i] = min(mp[Index][i], flow[Index]);Q.push(i);}}}// 如果不可以到达最后的点if (pre[End] == -1){return -1;}else{//返回起点到最后点剩余的流量return flow[End];}}int MaxFlow(int Start, int End)//返回 start -> End 的最大流{int ans = 0;int increaseflow = 0;//当前是否可以走到最后while ((increaseflow = BFS(Start, End)) != -1){int k = End;//下面代码用来修改地图流量while (k != Start){int Front_Index = pre[k];//Front_Index为k点的上一个点,利用前驱寻找路径mp[Front_Index][k] -= increaseflow;//改变正向边的容量 mp[k][Front_Index] += increaseflow;//改变反向边的容量 k = Front_Index;}ans += increaseflow;}return ans;}int main(){while (cin >> n >> m){int Start, End;int Val;memset(flow, 0, sizeof(flow));memset(mp, 0, sizeof(mp));for (int i = 0; i < n; i++){cin >> Start >> End >> Val;//如果起点终点相同则continueif (Start == End)continue;mp[Start][End] += Val;}cout << MaxFlow(1, m) << endl;}return 0;}
阅读全文
0 0
- HDU-1532(网络最大流)
- HDU 1532(网络流之最大流)
- hdu 1532 网络流-最大流 DINIC
- 图论 网络流 HDU 1532 最大流
- HDU-1532-网络流最大流
- HDU 1532 Drainage Ditches (最大网络流)
- HDU 1532 Drainage Ditches (最大网络流)
- hdu 1532 Drainage Ditches(最大网络流)
- hdu 1532 最大网络流 Drainage Ditches
- HDU 1532 Drainage Ditches 最大网络流
- hdu 4292 网络最大流
- 【网络流】HDU 1532 Drainage Ditches(最大流Ford-Fulkersson)+HDU 3549 Flow Problem(最大流Dinic算法)
- poj 1273 hdu 1532 网络流最大流 Dinic算法
- hdu 1532 最基础的求网络最大流问题
- hdu 1532(最大流)
- HDU 3549Flow Problem(网络流之最大流)
- HDU 3572Task Schedule(网络流之最大流)
- HDU 4280Island Transport(网络流之最大流)
- @ResponseBody 无法将实体类传回页面 详解
- 动态规划中级教程 279. Perfect Squares
- DAY49 CSS基础1
- mac Python 图形用户界面学习
- iframe 子页面与父页面通信
- HDU-1532(网络最大流)
- IO流——利用字节流复制图片
- 获取客户端真实IP
- 断路器(Hystrix)
- 浅谈单例设计模式探索
- js获取css值的方法:style、getComputedStyle和currentStyle
- 使用Python画股票的K线图
- 利用 Disk Drill 导出 iOS App 沙盒中的数据
- BZOJ4196: [Noi2015]软件包管理器 (好题