LightOJ - 1174 Commandos(floyd)

题目大意：给你N个点，M个人(M>N)，要求这些人同时从点S出发，走到点T，其间M个人要经过所有的点，问需要的最短时间

解题思路：floyd求出 S到任意点的距离和任意点到T的距离，接着找出最大的dp[S][i] + dp[i][T]即可

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 110;
const int INF = 0x3f3f3f3f;
int dis[N][N];
int n, m, s, t, cas = 1;

void init() {
    scanf("%d%d", &n, &m);
    memset(dis, 0x3f, sizeof(dis));
    for (int i = 0; i < n; i++)
        dis[i][i] = 0;
    int u, v;
    for (int i = 0; i < m; i++) {
        scanf("%d%d", &u, &v);
        dis[u][v] = dis[v][u] = 1;
    }
    scanf("%d%d", &s, &t);
}

void solve() {
    for (int k = 0; k < n; k++)
        for (int i = 0; i < n; i++)
            for (int j = 0; j < n; j++)
                if (dis[i][k] != INF && dis[k][j] != INF && dis[i][j] > dis[i][k] + dis[k][j])
                    dis[i][j] = dis[i][k] + dis[k][j];

    int Max= 0;
    for (int i = 0; i < n; i++) 
        if (dis[s][i] != INF && dis[i][t] != INF ) {
            Max = max(dis[s][i] + dis[i][t], Max);
        }
    printf("Case %d: %d\n", cas++, Max);

}

int main() {
    int test;
    scanf("%d", &test);
    while (test--) {
        init();
        solve();
    }
    return 0;
}