灾后重建就是对一个算法比较本质的了解,用floyd按点更新的特性写。
#include <bits/stdc++.h>
using namespace std;
const int N = 2 * 1e2 + 5;
int t[N],dis[N][N];
int main(){
memset(dis,0x3f,sizeof (dis));
memset(t,0x3f,sizeof t);
int n,m;
cin >> n >> m;
for(int i = 0;i < n;i ++)
scanf("%d",&t[i]),dis[i][i] = 0;
for(int i = 1;i <= m;i ++){
int fr,to,dist;
scanf("%d%d%d",&fr,&to,&dist);
dis[fr][to] = dis[to][fr] = dist;
}
int q;
cin >> q;
int k = 0;
for(int i = 1;i <= q;i ++){
int a,b,t1;
scanf("%d%d%d",&a,&b,&t1);
while(t[k] <= t1){
for(int i = 0;i < n;i ++)
for(int j = 0;j < n;j ++)
dis[i][j] = min(dis[i][j],dis[i][k] + dis[k][j]);
k ++;
}
if(dis[a][b] == 0x3f3f3f3f || t[a] > t1 || t[b] > t1) printf("-1\n");
else printf("%d\n",dis[a][b]);
}
return 0;
}
聪明的猴子是最小生成树,按边排序即可。