最优贸易(spfa和tarjan+拓扑排序+dp)

最优贸易

题目链接

大致题意:

n个点m条边，每个点有一个权值代表在这个点买或者卖水晶球的价格
有一个人从1走到n问你能够赚的最多的差价是多少（只能买卖一次）

---

解题思路:

这道题有很多写法,这里提供两种:spfa和tarjan+拓扑排序+dp

第一种方法:跑两遍spfa

以i点进行讨论,我们需要知道从1到i点买水晶球的最小值以及从i到n卖水晶球的最大值,两者相减极为答案

所以我们要跑两遍spfa,第一遍正向跑,用dis表示从1到i的最小值,第二遍反向跑,用d表示从n到i的最大值,答案为d[i]-dis[i]的最大值

第二种方法:tarjan+拓扑排序+dp

对于有一个连通块内的点都是可达的,我们就可以知道每一个连通块内的最大值和最小值,进行拓扑排序后就可以dp了

转移方程:f[v] = max(max(f[u], f[v]), maxcost[v] - minn[v])

答案就是f[id[n]]

---

AC代码:

#include <bits/stdc++.h>
#define rep(i, n) for (int i = 1; i <= (n); ++i)
#define debug(a) cout << #a << " = " << a << endl;
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int N = 1e5 + 10;
int n, m;
int w[N];
vector<int>e1[N], e2[N];
int d[N], dis[N]; //dis表示从1到i的最小值 d表示从n到i的最大值
void spfa(int dis[], vector<int> e[], int flag) {
	queue<int>q;
	if (!flag) {
		for (int i = 1; i <= n; ++i)dis[i] = INF;
		q.push(1);
	}
	else {
		for (int i = 1; i <= n; ++i)dis[i] = 0;
		q.push(n);
	}
	while (!q.empty()) {
		int u = q.front(); q.pop();
		dis[u] = (flag == 0 ? min(dis[u], w[u]) : max(dis[u], w[u]));
		for (auto& v : e[u]) {
			if (!flag) {
				if (dis[u] < dis[v]) {
					dis[v] = dis[u];
					q.push(v);
				}
			}
			else {
				if (dis[u] > dis[v]) {
					dis[v] = dis[u];
					q.push(v);
				}
			}
		}
	}
}
int main(void)
{
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; ++i)scanf("%d", &w[i]);
	while (m--) {
		int a, b, t; scanf("%d%d%d", &a, &b, &t);
		e1[a].push_back(b);
		e2[b].push_back(a);
		if (t == 2) {
			e1[b].push_back(a);
			e2[a].push_back(b);
		}
	}
	//0正向 1反向
	spfa(dis, e1, 0);
	spfa(d, e2, 1);
	int res = 0;
	for (int i = 1; i <= n; ++i)
		res = max(res, d[i] - dis[i]);
	printf("%d\n", res);
	return 0;
}

---

#include <bits/stdc++.h>
#define rep(i, n) for (int i = 1; i <= (n); ++i)
#define debug(a) cout << #a << " = " << a << endl;
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int N = 1e5 + 10;
int n, m;
int w[N], du[N];
vector<int>e[N], g[N]; //e是原图  g是缩点后的图
int dfn[N], low[N], timestamp;
stack<int>q;
int vis[N], id[N], scc_cnt;
int minn[N], mincost[N], maxcost[N], f[N];  //minn表示从1到i的最小值 mincost表示第i个连通块的最小值 maxcost表示第i个连通块的最大值 f表示能到达i点的路径上的最大差值
void tarjan(int u) {
	low[u] = dfn[u] = ++timestamp;
	q.push(u); vis[u] = 1;
	for (auto& v : e[u]) {
		if (!dfn[v]) {
			tarjan(v);
			low[u] = min(low[u], low[v]);
		}
		else if (vis[v])low[u] = min(low[u], dfn[v]);
	}
	int Min = INF, Max = -INF;
	if (low[u] == dfn[u]) {
		++scc_cnt;
		int v;
		do {
			v = q.top(); q.pop();
			vis[v] = 0; id[v] = scc_cnt;
			Max = max(Max, w[v]);
			Min = min(Min, w[v]);
		} while (v != u);
		mincost[scc_cnt] = Min;
		maxcost[scc_cnt] = Max;
	}
}
void topsort() {
	queue<int>q;
	for (int i = 1; i <= scc_cnt; ++i)
		if (!du[i])q.push(i);
	while (!q.empty()) {
		int u = q.front(); q.pop();
		for (auto& v : g[u]) {
			minn[v] = min(minn[u], mincost[v]);
			f[v] = max(max(f[u], f[v]), maxcost[v] - minn[v]);
			if (--du[v] == 0)q.push(v);
		}
	}
}
int main(void)
{
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; ++i)scanf("%d", &w[i]);
	while (m--) {
		int a, b, t; scanf("%d%d%d", &a, &b, &t);
		e[a].push_back(b);
		if (t == 2)e[b].push_back(a);
	}
	for (int i = 1; i <= n; ++i)
		if (!dfn[i])tarjan(i);
    //建缩点后的图
	for (int u = 1; u <= n; ++u)
		for (auto& v : e[u])
			if (id[u] != id[v]) {
				g[id[u]].push_back(id[v]);
				du[id[v]]++;
			}

	memset(minn, INF, sizeof minn);
	topsort();
	printf("%d\n", f[id[n]]);
	return 0;
}