详细解法:Johnson全源最短路算法
用于求边权带负的全源最短路
模板题:P5905 【模板】Johnson 全源最短路
令
d
i
s
i
,
j
dis_{i,j}
disi,j 为从
i
i
i 到
j
j
j 的最短路,在第
i
i
i 行输出
∑
j
=
1
n
j
×
d
i
s
i
,
j
\sum\limits_{j=1}^n j\times dis_{i,j}
j=1∑nj×disi,j
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 5e3 + 5;
#define INF 1e9
struct node {
int dis, id;
inline bool operator < (const node &x) const {
return dis > x.dis;
}
node (int x, int y) { dis = x, id = y; }
} ;
bool vis[maxn];
int n, m, in[maxn];
ll h[maxn], dis[maxn];
vector<pair<int, int> > G[maxn];
inline bool SPFA(int s) { //从源点开始求一遍最短路 , 记为 h
queue <int> q;
memset(h, 0x3f, sizeof(h));
h[s] = 0; vis[s] = 1; q.push(s);
while(!q.empty()) {
int u = q.front(); q.pop(); vis[u] = 0;
for(int i=0; i<G[u].size(); i++) {
int v = G[u][i].first, w = G[u][i].second;
if(h[v] > h[u]+w) {
h[v] = h[u] + w;
if(!vis[v]) {
vis[v] = 1; q.push(v);
if(++in[v] >= n) return 0;
}
}
}
} return 1;
}
inline void dijkstra(int s) { //从每个点开始走一遍最短路模板
priority_queue <node> q;
memset(vis, 0, sizeof(vis));
for(int i=1; i<=n; i++) dis[i] = (i==s) ? 0 : (INF);
q.push(node(0, s));
while(!q.empty()) {
int u = q.top().id; q.pop();
if(vis[u]) continue; vis[u] = 1;
for(int i=0; i<G[u].size(); i++) {
int v = G[u][i].first, w = G[u][i].second;
if(dis[v] > dis[u]+w) {
dis[v] = dis[u] + w;
if(!vis[v]) q.push(node(dis[v], v));
}
}
}
}
int main() {
scanf("%d%d", &n, &m);
while(m--) {
int u, v, w;
scanf("%d%d%d", &u, &v, &w);
G[u].push_back(make_pair(v, w));
// G[v].push_back(make_pair(u, w));
}
for(int i=1; i<=n; i++) G[0].push_back(make_pair(i, 0)); //创造上帝视角
if(!SPFA(0)) return puts("-1"), 0; //负环结束
for(int u=1; u<=n; u++)
for(int i=0; i<G[u].size(); i++)
G[u][i].second += h[u] - h[G[u][i].first]; //重构
for(int i=1; i<=n; i++) {
dijkstra(i); ll ans = 0;
for(int j=1; j<=n; j++)
ans += (dis[j]==INF) ? (j*INF) : (j*(dis[j]+h[j]-h[i]));
printf("%lld\n", ans); //跑最短路并统计答案
}
}