acwing 1128 信使(单源最短路)

题面

题解(单源最短路)

问题的转化：对于每个点，它接收到信的时间，等于它到指挥部的最短距离，因此只需要求 1号点到所有点的最短距离的最大值

代码

#include<bits/stdc++.h>

using namespace std;
const int N = 110, INF = 0x3f3f3f3f;

int n, m;
int dist[N][N];

void floy() {
    for (int k = 1; k <= n; k++) {
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
            }
        }
    }
}

int main() {
    memset(dist, 0x3f, sizeof dist);
    cin >> n >> m;
    for (int i = 0; i < m; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        dist[a][b] = dist[b][a] = min(dist[a][b], c);
    }
    floy();
    int res = 0;
    for (int i = 2; i <= n; i++) {
        if (dist[1][i] == INF) {
            res = -1;
            break;
        } else {
            res = max(res, dist[1][i]);
        }
    }
    cout << res << endl;
    
    return 0;
}