题意非常简单易懂,算是网络流最简单入门题目
有N条排水管道,M个结点(1为源点,M为汇点)
最大容量已知
求最大流
仿照SAP的写法
#include <iostream>
#include <vector>
#include <map>
#include <list>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cctype>
#include <cstdio>
#include <iomanip>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <cstring>
#include <queue>
using namespace std;
///宏定义
const int INF = 20000000;
const int MAXN = 210;
#define MAX 9999999
#define CLR(arr, what) memset(arr, what, sizeof(arr))
///全局变量 和 函数
int N, M;// N 代表 管道的数目(即边数) M代表结点的数目
int maze[MAXN][MAXN];
int pre[MAXN], cur[MAXN]; //前驱、后继
int gap[MAXN]; //层结点数(用于间隙优化)
int dis[MAXN]; //到汇点的最少弧的数目
int SAP(int s, int t, int n) //源点、汇点、结点数
{
CLR(gap, 0); CLR(cur, 0); CLR(dis, 0);
int u = pre[s] = s, maxflow = 0, aug = MAX, v;
gap[0] = n;
while(dis[s] < n)
{
bool flag = false;
for(v = cur[u]; v <= n; ++v) //寻找允许弧
{
if(maze[u][v] > 0 && dis[u] == dis[v] + 1)
{
flag = true;
break;
}
}
if(flag) //找到允许弧
{
pre[v] = u;
cur[u] = v;
aug = min(aug, maze[u][v]);
u = v;
if(v == t) //找到完整增广路
{
maxflow += aug;
for(v = t; v != s; v = pre[v]) //更新残留网络
{
maze[pre[v]][v] -= aug; //正向边
maze[v][pre[v]] += aug; //反向边
}
aug = MAX, u = s; //重新从源点寻找
}
}
else //找不到允许弧
{
int mindis = n;
for(v = 1; v <= n; ++v) //重新标号
{
if(maze[u][v] && mindis > dis[v])
{
cur[u] = v;
mindis = dis[v];
}
}
if(--gap[dis[u]] == 0) //更新断层 + 判断是否断层(间隙优化)
break;
gap[dis[u] = mindis + 1]++; //更新断层
u = pre[u]; //当前弧优化
}
}
return maxflow;
}
int main()
{
///
int i, j;
int from, to, mflow;
int answer;
while(scanf("%d %d", &N, &M) != EOF)
{
CLR(maze, 0);
//构图
for(i = 0; i < N; ++i)
{
scanf("%d %d %d", &from, &to, &mflow);
maze[from][to] += mflow;
}
answer = SAP(1, M, M);
printf("%d\n", answer);
}
///
return 0;
}