hdu1385 Minimum Transport Cost

#include<stdio.h>
#define Max 0xfffffff
#define N 600
bool vis[N];
int path[N][N];//昨天把path数组定义为BOOl型了，输出的时候老是死循环，昨天检查了一晚上没发现，今天多亏了我强悍的队友给我指明了错误！！ 
int d[N][N],cost[N];
int vexnum,arcnum;
void floyd()
{
    for(int k=0;k<vexnum;++k)
        for(int i=0;i<vexnum;++i)
            for(int j=0;j<vexnum;++j){
                int temp=d[i][k]+d[k][j]+cost[k];
                if(d[i][j]>temp||(d[i][j]==temp&&path[i][k]<path[i][j])){
                    d[i][j]=temp;
                    path[i][j]=path[i][k];
                }
            }
}
int main()
{
    int i,j,k,start,end;
    while(scanf("%d",&vexnum),vexnum){
        for(i=0;i<vexnum;++i){
            for(j=0;j<vexnum;++j){
                scanf("%d",&d[i][j]);
                if(d[i][j]==-1)
                    d[i][j]=d[j][i]=Max;
                path[i][j]=j;
            }
        }
        for(i=0;i<vexnum;++i)
            scanf("%d",&cost[i]);
        floyd();
        while(scanf("%d%d",&start,&end),~start||~end){
            printf("From %d to %d :\nPath: %d",start,end,start);
            start--;end--;
            int k=start;
            while(k!=end){
                printf("-->%d",path[k][end]+1);
                k=path[k][end];
            }
            printf("\nTotal cost : %d\n\n",d[start][end]);
        }
    }
    return 0;
}