emmm。
其实我也想不到题解呢。我们可以选定一个点,在这个点之前买,在这个点之后卖,那么问题就转化为max与min问题。然后就可以码了。
值得注意的是,minn数组与maxx数组不要赋初值,因为有可能根本走不到这个点!!!
#include<cstdio>
#include<vector>
#include<queue>
#include<iostream>
using namespace std;
const int N = 100002;
int n, m, w[N], minn[N], maxx[N], ans, limit = (1 << 30) - 1;
vector <int> a[N], b[N];
bool vis[N];
queue <int> q;
void spfa(const int S) {
for(int i = 1; i <= n; i ++)
minn[i] = limit;
q.push(S);
minn[S] = w[S];
vis[S] = 1;
while(! q.empty()) {
int u = q.front();
q.pop();
vis[u] = 0;
for(int i = 0; i < a[u].size(); i ++) {
int v = a[u][i];
if(minn[v] > min(minn[u], w[v])) {
minn[v] = min(minn[u], w[v]);
if(! vis[v]) {
q.push(v);
vis[v] = 1;
}
}
}
}
}
void SPFA(const int S) {
for(int i = 1; i <= n; i ++)
vis[i] = 0;
q.push(S);
maxx[S] = w[S];
vis[S] = 1;
while(! q.empty()) {
int u = q.front();
q.pop();
vis[u] = 0;
for(int i = 0; i < b[u].size(); i ++) {
int v = b[u][i];
if(maxx[v] < max(maxx[u], w[v])) {
maxx[v] = max(maxx[u], w[v]);
if(! vis[v]) {
q.push(v);
vis[v] = 1;
}
}
}
}
}
int main() {
int x, y, z;
scanf("%d %d", &n, &m);
for(int i = 1; i <= n; i ++) {
scanf("%d", &w[i]);
}
for(int i = 1; i <= m; i ++) {
scanf("%d %d %d", &x, &y, &z);
if(z == 1) {
a[x].push_back(y);
b[y].push_back(x);
}
else {
a[x].push_back(y);
b[y].push_back(x);
a[y].push_back(x);
b[x].push_back(y);
}
}
spfa(1);
SPFA(n);
for(int i = 1; i <= n; i ++)
ans = max(ans, maxx[i] - minn[i]);
printf("%d\n", ans);
return 0;
}
另外,想贴一份玄学题解。当当当
拜拜!