hdu 3549 isap

http://www.renfei.org/blog/isap.html好的教程

看完算法描述再看我下面所讲绝对全懂。。。。。。

isap算法中我觉得不好理解的地方就是gap优化其他都好说。。现在就谈谈gap优化:

1.因为你是走最短路那么如果从起点走到某个点u这个点到终点的距离是d[u]此时如果num[d[u]]--后等于0根据算法的描述此时你要更新然后回退.这样造成的结果就是，你最多就只能更新d[k]>d[u]的点而且更新后这些点的d[k]越来越大，反正你只能更新d[k]>d[u]的点d[u]更新后也是大于原值的因为是最短路嘛。。。，为什么?(用起点到u是最短路这条线索推理一下就好了其它点不在最短路上说明d[k]>d[u]）

这样造成的结果就是永远到不了终点了。。。。

总之关键就是注意最短路这条线索，然后注意算法描述是先回退，然后更新。。仔细想想就明白了。。。

isap就三部 1.前进 2.更新（注意gap的更新,注意父亲的更新).3 后退(注意起点不能后退)...什么编程复杂度相对于伸展树，树套树那些根本不是事儿。。。。。

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
struct edgee
{
	int from, cap, to, rev;
};
struct dist
{
	int value, fa, edgenum;
};
edgee edge[2000];
int first[17],nextt[2000],change[17],num[2000];
dist d[17];
int n, m,s,t;
int  minflow = 1000000000;
int tot;
int ans;
void addedge(int from, int to, int cap)
{
	edge[tot].from = from;
	edge[tot].to = to;
	edge[tot].cap = cap;
	edge[tot].rev = tot + 1;
	nextt[tot] = first[from];
	first[from] = tot;
	tot++;
	edge[tot].from = to;
	edge[tot].to = from;
	edge[tot].cap = 0;
	edge[tot].rev = tot - 1;
	nextt[tot] = first[to];
	first[to] = tot;
	tot++;
}

void bfs(int t)
{
	for (int i = 1; i <= n; i++)
		d[i].value = 1000000000;
	d[t].value = 0;
	num[0] = 1;
	queue<int>que;
	que.push(t);
	while (!que.empty())
	{
		int now = que.front();
		que.pop();
		for (int i = first[now]; i != -1; i = nextt[i])
		{
			int to = edge[i].to;
			if (d[to].value == 1000000000)//bfs的时候并不需要流量限制如果那样的话不能构成最短路开始时候，dinic才需要考虑流量
			{
				d[to].value = d[now].value + 1;
				d[now].fa =to; d[now].edgenum = edge[i].rev;//忘.....
				if(d[to].value<=n)num[d[to].value]++;//这步忘了
				que.push(to);
			}
		}
	}
}
void augument()
{
	ans += minflow;
	for (int i = t; i != s; i = d[i].fa)
	{
		int num = d[i].edgenum; int rev = edge[num].rev;
		edge[num].cap -= minflow;
		edge[rev].cap += minflow;
	}
	minflow = 1000000000;
}
void isap(int s)
{
	int temp = s;
	while (d[s].value <= n)//其实很遗憾的是d[s]永远也不会等于n,最多只能为n-1或者是1000000000;
	{
		if (temp == t)
		{
			augument();
			temp = s;
		}
		bool isahead = false;//必须要有个变量。。
		for (int &i = change[temp]; i != -1; i = nextt[i])
		{
			int to = edge[i].to;
			if (d[temp].value == d[to].value + 1 && edge[i].cap > 0)
			{
				minflow = min(minflow, edge[i].cap);
				d[to].fa = temp;
				d[to].edgenum = i;
				temp = to;
				isahead = true;
				break;
			}
		}
		if (!isahead)
		{
			int mindist = 1000000000;
			for (int i = first[temp]; i != -1; i = nextt[i])
			{
				if (d[edge[i].to].value < mindist&&edge[i].cap>0)
				{
					mindist = min(mindist,d[edge[i].to].value);
				}
			}
			if (d[temp].value <=n)num[d[temp].value]--;
			if (num[d[temp].value] == 0)break;
			change[temp] = first[temp];//注意这部
			d[temp].value = mindist + 1;//
			if (d[temp].value <=n)num[d[temp].value]++;
			if (temp != s)//注意这部
			temp = d[temp].fa;
		}
	}
}
int main()
{

	int times;
	scanf("%d", ×);
	int realtimes = 1;
	while (realtimes<=times)
	{
		tot = 0;
		ans = 0;
		minflow = 1000000000;
		scanf("%d%d", &n, &m);
		s = 1; t = n;
		
		for (int i = 1; i <= n; i++)first[i] = -1;
		for (int i = 0; i < m; i++)
		{
			int a, b, c;
			scanf("%d%d%d", &a, &b, &c);
			addedge(a, b, c);
		}
		for (int i = 1; i <= n; i++)change[i] = first[i];//准备当前弧优化
		for (int i = 0; i <= n; i++)num[i] = 0;//这里注意顺序先开始写反了，debug了好久....
		bfs(n);
		//for (int i = 1; i <= n; i++)
			//cout << d[i].value << endl;
		isap(1);
		printf("Case %d: %d\n",realtimes, ans);
		realtimes++;
	}
	return 0;
}