Sightseeing Trip（Floyd）

原题链接

解题思路：Floyd求最小环问题

C++代码

#include <bits/stdc++.h>
using namespace std;
const int N = 110, INF = 0x3f3f3f3f;
int g[N][N], d[N][N];
int pos[N][N];
int path[N], cnt;
int n, m;
int ans = INF;

void get_path(int i, int j)
{
    if (pos[i][j] == 0) return ;
    else
    {
        get_path(i, pos[i][j]);
        path[cnt ++ ] = pos[i][j];
        get_path(pos[i][j], j);
    }
}

void floyd()
{
    for (int k = 1; k <= n; k ++ )
    {
        for (int i = 1; i < k; i ++ )
        {
            for (int j = i + 1; j < k; j ++ )
            {
                if ((long long) d[i][j] + g[j][k] + g[k][i] < ans)
                {
                    ans = d[i][j] + g[j][k] + g[k][i];
                    cnt = 0;
                    path[cnt ++ ] = j;
                    path[cnt ++ ] = k;
                    path[cnt ++ ] = i;
                    get_path(i, j);
                }
            }
        }
        for (int i = 1; i <= n; i ++ )
        {
            for (int j = 1; j <= n; j ++ )
            {
                if (d[i][j] > d[i][k] + d[k][j])
                {
                    d[i][j] = d[i][k] + d[k][j];
                    pos[i][j] = k;
                }
            }
        }
    }
}

int main()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i ++ )
    {
        for (int j = 1; j <= n; j ++ )
        {
            if (i != j) g[i][j] = INF;
        }
    }
    for (int i = 0; i < m; i ++ )
    {
        int a, b, c;
        cin >> a >> b >> c;
        g[a][b] = g[b][a] = min(g[a][b], c);
    }
    memcpy(d, g, sizeof d);
    floyd();
    if (ans == INF) cout << "No solution." << endl;
    else 
    {
        for (int i = 0; i < cnt; i ++ ) cout << path[i] << " ";
    }
    return 0;
}

参考博客