floyd
题目链接:https://www.acwing.com/problem/content/856/
时间复杂度:O( N 3 N^3 N3)
适用于:多源最短路
算法思想:
基于
D
P
DP
DP 的思想,三层循环,最外层为
k
k
k ,里面两层随意
每次更新
d
p
[
i
]
[
j
]
=
m
i
n
(
d
p
[
i
]
[
j
]
,
d
p
[
i
]
[
k
]
+
d
p
[
k
]
[
j
]
)
dp[i][j] = min(dp[i][j],dp[i][k] + dp[k][j])
dp[i][j]=min(dp[i][j],dp[i][k]+dp[k][j])
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 510,INF = 0x3f3f3f3f;
int n,m,q;
int d[N][N];
void Floyd()
{
for(int k = 1; k <= n; k++)
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
d[i][j] = min(d[i][j],d[i][k] + d[k][j]);
}
int main()
{
scanf("%d%d%d",&n,&m,&q);
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
if(i == j) d[i][j] = 0;
else d[i][j] = INF;
while(m--)
{
int a,b,w;
scanf("%d%d%d",&a,&b,&w);
d[a][b] = min(d[a][b],w);
}
Floyd();
while(q--)
{
int a,b;
scanf("%d%d",&a,&b);
if(d[a][b] > INF / 2) printf("impossible\n");
else printf("%d\n",d[a][b]);
}
return 0;
}