ACM/ICPC 之 網絡流入門-Ford Fulkerson與SAP算法(POJ1149-POJ1273)

　　　第一題：按顧客訪問豬圈的順序依次構圖（顧客爲結點），匯點->第一個顧客->第二個顧客->...->匯點

 

 

//第一道網絡流
//Ford-Fulkerson
//Time:47Ms		Memory:276K
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;

#define MAXN 105	//顧客
#define MAXM 1005	//豬圈
#define INF 0x3f3f3f3f

struct Arc {
	int c, f;
}e[MAXN][MAXN];

int n, m;
int s, t;
int pig[MAXM], last[MAXM];	//last[]:豬圈當前顧客(0爲源點，n+1爲匯點)
int pre[MAXN];		//1.從哪個結點
int alpha[MAXN];	//2.可改進量

void ford()	//ford fulkerson
{
	alpha[s] = INF;	//源點可改進量無限
	while (1) {	//屢次標號
		memset(pre, -1, sizeof(pre));	//初始標號
		queue<int> q;
		q.push(s);
		while (!q.empty() && pre[t] == -1) {
			int cur = q.front();	q.pop();
			for (int i = 1; i <= t; i++)
			{
				int tmp;
				//tmp 爲非0可保證鄰接且保證有剩餘流量
				if (pre[i] == -1 && (tmp = e[cur][i].c - e[cur][i].f))
				{
					pre[i] = cur;
					q.push(i);
					alpha[i] = min(alpha[cur], tmp);
				}
			}
		}
		if (pre[t] == -1)	return;	//未找到增廣路
		for (int i = pre[t], j = t; i != -1; j = i, i = pre[i])
		{
			e[i][j].f += alpha[t];
			e[j][i].f = -e[i][j].f;
		}
	}

}
 
int main()
{
	//freopen("in.txt", "r", stdin);

	memset(last, 0, sizeof(last));
	memset(e, 0, sizeof(e));
	scanf("%d%d", &m, &n);
	s = 0;	t = n + 1;
	for (int i = 1; i <= m; i++)
		scanf("%d", &pig[i]);
	for (int i = 1; i <= n; i++)
	{
		int num;	//鑰匙數
		scanf("%d", &num);
		while (num--) {
			int pn;
			scanf("%d", &pn);
			if (last[pn] == 0)
				e[last[pn]][i].c += pig[pn];
			else e[last[pn]][i].c = INF;
			last[pn] = i;
		}
		scanf("%d", &e[i][t].c);
	}

	ford();

	int maxFlow = 0;
	for (int i = 1; i < t; i++)
		maxFlow += e[i][t].f;
	printf("%d\n", maxFlow);

	return 0;
}

 

　　第二道：最短增廣路(SAP)算法，dinic算法前身，與dinic不一樣的是須要屢次採用BFS進行構建層次網絡，題目自己較直接。

 

//網絡流
//通常最短增廣路算法-Dinic算法的前身
//Time:16Ms		Memory:676K
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;

#define MAX 205
#define INF 0x3f3f3f3f

struct Arc {
	int c, f;
}e[MAX][MAX];

int n, m;
int s, t;
int pre[MAX];
int res[MAX][MAX];	//殘留網絡->層次網絡
bool v[MAX];

void bfs()
{
	while (1)	//屢次BFS尋找增廣路
	{
		memset(v, false, sizeof(v));
		memset(res, 0, sizeof(res));
		memset(pre, 0, sizeof(pre));
		queue<int> q;
		q.push(s);	v[s] = true;
		while (!q.empty() && pre[t] == 0)
		{	//BFS構造層次網絡
			int cur = q.front();	q.pop();
			for (int i = 1; i <= n; i++)
			{
				if (!v[i]) {
					int tmp = e[cur][i].c - e[cur][i].f;
					if (tmp > 0) {	//正向有殘留容量
						res[cur][i] = tmp;
						pre[i] = cur;
						q.push(i);	v[i] = true;
					}
					else if (e[i][cur].f > 0) {	//反向有流量
						res[cur][i] = e[i][cur].f;
						pre[i] = cur;
						q.push(i);	v[i] = true;
					}
				}
			}
		}
		if (pre[t] == 0)	return;
		int minroad = INF;	//最小可改進量
		for (int i = t; i != s; i = pre[i])
			minroad = min(minroad, res[pre[i]][i]);
		for (int i = t; i != s; i = pre[i])
		{
			if (e[pre[i]][i].c - e[pre[i]][i].f > 0)
				e[pre[i]][i].f += minroad;
			else if (e[i][pre[i]].f > 0)
				e[i][pre[i]].f -= minroad;
		}

	}
}

int main()
{
	//freopen("in.txt", "r", stdin);

	while (~scanf("%d%d", &m, &n))
	{
		memset(e, 0, sizeof(e));
		int u, v, c;
		for (int i = 0; i < m; i++)
		{
			scanf("%d%d%d", &u, &v, &c);
			e[u][v].c += c;
		}

		s = 1;	t = n;
		bfs();

		int maxFlow = 0;
		for (int i = 1; i < n; i++)
			maxFlow += e[i][t].f;
		printf("%d\n", maxFlow);
	}

	return 0;
}