POJ-1135-Domino Effect

求最短路径题，最后需要进行一个特殊的判断

代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<queue>
#include<cstdlib>
#define MAX 430001
using namespace std;
int nxt[MAX],pnt[MAX],cost[MAX],head[MAX],dist[501],map[501][501],e,n;
bool vis[501];
const int inf=1<<28;
void addedge(int u,int v,int c)
{
    pnt[e]=v;cost[e]=c;nxt[e]=head[u];head[u]=e++;
}
int relax(int u,int v,int c)
{
    if(dist[v]>dist[u]+c)
    {
	dist[v]=dist[u]+c;
	return 1;
    }
    return 0;
}
void SPFA()
{
    memset(vis,0,sizeof(vis));
    for(int i=1;i<=n;i++)
	dist[i]=inf;
    dist[1]=0;
    vis[1]=1;
    queue<int> q;
    q.push(1);
    while(!q.empty())
    {
	int u,v;
	u=q.front();
	q.pop();
	vis[u]=0;
	for(int i=head[u];i!=-1;i=nxt[i])
	{
	    v=pnt[i];
	    if(relax(u,v,cost[i])&&!vis[v])
	    {
		q.push(v);
		vis[v]=1;
	    }
	}
    }
}
int main()
{
    int m,cas=1;
    while(scanf("%d%d",&n,&m)&&(n||m))
    {
	e=0;
	if(m==0)
	{
	    printf("System #%d\n",cas++);
	    printf("The last domino falls after 0.0 seconds, at key domino 1.\n\n");
	    continue;
	}
	memset(head,-1,sizeof(head));
	for(int i=1;i<=n;i++)
	    for(int j=1;j<=n;j++)
		map[i][j]=inf;
	for(int i=0;i<m;i++)
	{
	    int a,b,c;
	    scanf("%d%d%d",&a,&b,&c);
	    addedge(a,b,c);
	    addedge(b,a,c);
	    map[a][b]=map[b][a]=c;
	}
	SPFA();
	double ans=0,time1=0,time2=0;
	int ansa,ansb,ansc,flag=0;
	for(int i=1;i<=n;i++)
	{
	    if(dist[i]>time1)
	    {
		time1=dist[i];
	        ansc=i;
	    }
	    for(int j=i+1;j<=n;j++)
	    {
		if(map[i][j]!=inf&&abs(dist[i]-dist[j])<map[i][j])
		{
		    if((dist[j]+(map[i][j]-abs(dist[i]-dist[j]))/2.0)>time2)
		    {
			time2=max(dist[j],dist[i])+((map[i][j]-abs(dist[i]-dist[j]))/2.0);
			ansa=i;
			ansb=j;
		    }
		}
	    }
	}
	ans=max(time1,time2);
	printf("System #%d\n",cas++);
	if(ans==time1)
	    printf("The last domino falls after %.1lf seconds, at key domino %d.\n",ans,ansc);
	else
	    printf("The last domino falls after %.1lf seconds, between key dominoes %d and %d.\n",ans,ansa,ansb);
	printf("\n");
    }
    return 0;
}