题目大意
n个城市,m条路径(某些为单向边某些为双向边)
每个城市都可以买或卖水晶球(但是整个只能买或卖一次),问最后能赚取的最大差价是多少
解法
基于spfa算法
每个城市的价格为price,当前最优的买入价格是buy,最优的卖出价格是sale
那么我们就可以知道buy[v]=min(price[v],buy[u]),最优的卖出价格是sale[v]=max(price[v],sale[u]),然后注意要建两个图,一个正向图,一个反向图,正向图跑的是排入价格,反向图跑的是卖出价格
代码如下:
#include <bits/stdc++.h>
using namespace std;
vector<int> edge1[100010];
vector<int> edge2[100010];
int val[100010];
int buy[100010];
int sale[100010];
int n, m;
struct node1
{
int to;
bool friend operator<(node1 a, node1 b)
{
return buy[a.to] > buy[b.to];
}
};
struct node2
{
int to;
bool friend operator<(node2 a, node2 b)
{
return sale[a.to] < sale[b.to];
}
};
bool vis[100010];
void spfa1()
{
memset(buy, 0x7f, sizeof(buy));
buy[1] = val[1];
priority_queue<node1> q;
q.push(node1{1});
memset(vis, 0x0, sizeof(vis));
vis[1] = true;
while (!q.empty())
{
int u = q.top().to;
q.pop();
vis[u] = false;
for (auto &&v : edge1[u])
{
if (buy[v] > min(buy[u], val[v]))
{
buy[v] = min(buy[u], val[v]);
if (!vis[v])
{
vis[v] = true;
q.push(node1{v});
}
}
}
}
}
void spfa2()
{
memset(sale, 0x0, sizeof(sale));
sale[n] = val[n];
priority_queue<node2> q;
q.push(node2{n});
memset(vis, 0x0, sizeof(vis));
vis[n] = true;
while (!q.empty())
{
int u = q.top().to;
q.pop();
vis[u] = false;
for (auto &&v : edge2[u])
{
if (sale[v] < max(sale[u], val[v]))
{
sale[v] = max(sale[u], val[v]);
if (!vis[v])
{
vis[v] = true;
q.push(node2{v});
}
}
}
}
}
int main()
{
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
{
scanf("%d", &val[i]);
}
for (int i = 1, u, v, flag; i <= m; i++)
{
scanf("%d %d %d", &u, &v, &flag);
edge1[u].push_back(v);
edge2[v].push_back(u);
if (flag == 2)
{
edge1[v].push_back(u);
edge2[u].push_back(v);
}
}
spfa1();
spfa2();
int ans = 0;
for (int i = 1; i <= n; i++)
ans = max(ans, sale[i] - buy[i]);
printf("%d", ans);
return 0;
}