HDU 3549 网络流初步
来源:互联网 发布:学篮球的软件 编辑:程序博客网 时间:2024/06/07 14:45
Flow ProblemTime Limit: 5000/5000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 12912 Accepted Submission(s): 6154Problem DescriptionNetwork flow is a well-known difficult problem for ACMers. Given a graph, your task is to find out the maximum flow for the weighted directed graph.InputThe first line of input contains an integer T, denoting the number of test cases.For each test case, the first line contains two integers N and M, denoting the number of vertexes and edges in the graph. (2 <= N <= 15, 0 <= M <= 1000)Next M lines, each line contains three integers X, Y and C, there is an edge from X to Y and the capacity of it is C. (1 <= X, Y <= N, 1 <= C <= 1000)OutputFor each test cases, you should output the maximum flow from source 1 to sink N.Sample Input23 21 2 12 3 13 31 2 12 3 11 3 1Sample OutputCase 1: 1Case 2: 2
昨天看了一个下午的网络流,大体上懂了 Ford - Fulkerson 方法的EK算法,拿这题贯通一下
#include <cstdio>#include <cstring>#include <queue>#include <climits>using namespace std;#define MAX_V 15*2#define MAX_E 1000*2int Pre[MAX_E]; bool Visit[MAX_E];int Map[MAX_E][MAX_E]; bool BFS(int s,int t,int V,int E){ int cur; queue<int> Q; memset(Pre,0,sizeof Pre); memset(Visit,false,sizeof Visit); Visit[s] = true; Q.push(s); while(!Q.empty()) { cur = Q.front();Q.pop(); if(cur == t) return true; for(int i=1;i<=V;++i) { if(!Visit[i] && Map[cur][i]) { Q.push(i); Pre[i] = cur; Visit[i] = true; } } } return false;}int Max_flow(int s,int t,int V,int E) { int flow = 0; while(true) { if(!BFS(s,t,V,E)) return flow; int Min = INT_MAX; for(int i=t;i!=s;i=Pre[i]) Min = min(Min,Map[Pre[i]][i]); for(int i=t;i!=s;i=Pre[i]) { Map[Pre[i]][i] -= Min; Map[i][Pre[i]] += Min; } flow += Min; }}void Handle(int V,int E){ memset(Map,0,sizeof Map); for(int i = 1,u,v,c;i <= E;i++) { scanf("%d %d %d",&u,&v,&c); Map[u][v] += c; }}int main(void){ // freopen("F:\\test.txt","r",stdin); int T;scanf("%d",&T); for(int i=1;i<=T;i++) { int V,E; scanf("%d %d",&V,&E); //V<=15,E<=1000,C<=1000 Handle(V,E); printf("Case %d: %d\n",i,Max_flow(1,V,V,E)); }}
0 0
- HDU 3549 网络流初步
- HDU - 1532 - Drainage Ditches && 3549 - Flow Problem (网络流初步)
- 网络流初步
- 网络流初步总结
- 网络流初步总结
- 网络流初步
- 网络流初步
- 网络流初步
- 【网络流】hdu 3549
- 网络流初步: 最大流
- 网络流初步 最大流
- 网络流初步-最大流
- 网络流初步 2016.8.1
- POJ3281Dinicing(网络流初步)
- HDU 3549(网络流)
- 网络流初步 最大流问题
- 网络流初步——dinic算法
- POJ 1459 Power Network网络流初步
- 安卓旧项目使用Small框架插件化改造踩坑记
- 关于JS下offsetLeft,style.left,以及jquery中的offset().left,css("left")的区别。
- 揭开RTMP播放流程的神秘面纱
- wampserver3.0.4安装配置
- MySql导出、导入数据
- HDU 3549 网络流初步
- poj 1258 (最小生出树 水)
- POJ 2187 平面上的最远点
- AngularJs服务
- HDU5733 tetrahedron
- Python机器学习与实战笔记之逻辑斯蒂回归Logistic Regression, LR
- Linux 下几款程序内存泄漏检查工具
- C++、Visual C++、MFC(编译和封装)之间的关系是什么?
- guava之比较器(1)