ZOJ-1456-Minimum Transport Cost

用Floyd算法做，用spfa wa不知道为什么

代码：

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
const int maxn=133;
const int inf=1<<29;
int n,map[maxn][maxn],p[maxn][maxn],c[maxn];
void Floyd()
{
    for(int k=1;k<=n;k++)
	for(int i=1;i<=n;i++)
	    for(int j=1;j<=n;j++)
		if(map[i][j]>map[i][k]+map[k][j]+c[k])
		{
		    map[i][j]=map[i][k]+map[k][j]+c[k];
		    p[i][j]=p[i][k];
		}
		else if(map[i][j]==map[i][k]+map[k][j]+c[k])
		    if(p[i][j]>p[i][k])
			p[i][j]=p[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",&map[i][j]);
		p[i][j]=j;
		if(map[i][j]==-1)
		    map[i][j]=inf;
	    }
	for(int i=1;i<=n;i++)
	    scanf("%d",&c[i]);
	Floyd();
	int st,ed;
	while(scanf("%d%d",&st,&ed)&&st!=-1)
	{
	    printf("From %d to %d :\n",st,ed);
	    printf("Path: %d",st);
	    for(int i=st;i!=ed;i=p[i][ed])
		printf("-->%d",p[i][ed]);
	    printf("\nTotal cost : %d\n\n",map[st][ed]);
	}
		    
    }
    return 0;
}