POJ 1122 FDNY to the Rescue! Floyd 打印路径就行了

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <cmath>
#include <cstring>
using namespace std;
#define INF 0xfffffff
#define maxn 40

struct Point
{
    int e, w;
} dist[maxn];

bool cmp(Point A,Point B)
{
    return A.w < B.w;
}
int Path[maxn][maxn], G[maxn][maxn], n;

void Floyd()
{
    for(int k=1; k<=n; k++)
    {
        for(int i=1; i<=n; i++)
        {
            for(int j=1; j<=n; j++)
            {
                if(G[i][j] > G[i][k] + G[k][j] )
                {
                    G[i][j] = G[i][k] + G[k][j];
                    Path[i][j] = Path[i][k];
                }
            }
        }
    }
}

void PutPath(int Star,int End)
{
    while(Star != End)
    {
        printf("\t%d", Star);
        Star = Path[Star][End];
    }
    printf("\t%d\n", Star);
}

int main()
{
    int a;

    cin >> n;

    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=n; j++)
        {
            Path[i][j] = j;
            cin >> G[i][j];

            if(G[i][j] == -1)
                G[i][j] = INF;
        }
    }
    int End, k = 0;

    Floyd();

    cin >> End;

    while(scanf("%d",&a) != EOF)
    {
        dist[k].w = G[a][End];
        dist[k++].e = a;
    }

    sort(dist, dist + k, cmp);

    cout << "Org\tDest\tTime\tPath" << endl;

    for(int i=0; i<k; i++)
    {
        printf("%d\t%d\t%d", dist[i].e, End, G[dist[i].e][End]);

        PutPath(dist[i].e, End);
    }
    return 0;
}