[图论]最大权最短路径

https://www.51nod.com/onlineJudge/questionCode.html#!problemId=1459
其实就是在路径相等的时候更新一下最大权就好了。

#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
struct edge{
    int v, c;
};
vector<edge> g[505];
int a[505], d[505], w[505];
int main()
{
    ios::sync_with_stdio(0); cin.tie(0);
    int n, m, s, e;
    cin >> n >> m >> s >> e;
    for (int i = 0; i < n; ++i) cin >> a[i];
    for (int i = 0; i < m; ++i){
        int u, v, c;
        cin >> u >> v >> c;
        g[u].push_back(edge{v, c});
        g[v].push_back(edge{u, c});
    }
    memset(d, 0x3f, sizeof(d));
    d[s] = 0, w[s] = a[s];
    priority_queue<pii, vector<pii>, greater<pii> > pqi;
    pqi.push(pii(0, s));
    while(!pqi.empty()){
        pii e = pqi.top(); pqi.pop();
        if (d[e.second] < e.first) continue;
        int u = e.second, c = e.first;
        for (int i = 0; i < g[u].size(); ++i){
            if (c + g[u][i].c == d[g[u][i].v]) w[g[u][i].v] = max(w[g[u][i].v], w[u] + a[g[u][i].v]);
            else if (c + g[u][i].c < d[g[u][i].v]){
                d[g[u][i].v] = c + g[u][i].c;
                w[g[u][i].v] = w[u] + a[g[u][i].v];
                pqi.push(pii(d[g[u][i].v], g[u][i].v));
            }
        }
    }
    cout << d[e] << " " << w[e] << endl;
    return 0;
}