HDU 1385

用Floyd并且增加对其dist[i][j] == dist[i][k]+dist[k][j]+cost[k] && path[i][j]>path[i][k]

即可对dist相同状况下，保证path[i]下最小的情况置换出来

#include<cstdio>
#include<cstring>
#define INF 1e9
using namespace std;
const int maxn = 100+20;
int n;
int cost[maxn];
int dist[maxn][maxn];//最短距离
int path[maxn][maxn];//path[i][j]保存了从i到j路径的第一个点(除i以外)
void floyd()
{
    for(int i=1;i<=n;i++)
    for(int j=1;j<=n;j++)
        path[i][j]=j;

    for(int k=1;k<=n;k++)
    for(int i=1;i<=n;i++)
    for(int j=1;j<=n;j++)
    if(dist[i][k]<INF && dist[k][j]<INF)
    {
        if(dist[i][j] > dist[i][k]+dist[k][j]+cost[k])
        {
            dist[i][j] = dist[i][k]+dist[k][j]+cost[k];
            path[i][j] = path[i][k];
        }
        else if(dist[i][j] == dist[i][k]+dist[k][j]+cost[k] && path[i][j]>path[i][k])
        {
            path[i][j]=path[i][k];
        }
    }
}

int main()
{
    while(scanf("%d",&n)&&n){
        for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++){
            scanf("%d",&dist[i][j]);
            if(dist[i][j]==-1)dist[i][j]=INF;
        }
        for(int i=1;i<=n;i++)scanf("%d",&cost[i]);
        floyd();
        int u,v;
        while(scanf("%d%d",&u,&v)){
            if(u==-1&&v==-1)break;
            int from=u;
            printf("From %d to %d :\n",u,v);
            printf("Path: ");
            while(true){
                if(u!=v){
                    printf("%d-->",u);
                    u=path[u][v];
                }
                else{
                    printf("%d\n",u);
                    break;
                }
            }
            printf("Total cost : %d\n\n",dist[from][v]);
        }
    }
    return 0;
}