http://acm.hdu.edu.cn/showproblem.php?pid=2544
#include<stdio.h>
#define Min(a,b) a>b?b:a
#define inf 0x7FFFFFFF
#define M 101
int map[M][M];
int minload[M];
int visit[M];
int main()
{
int n,m,i,j,a,b,dis,start,min,next;
while (scanf("%d%d",&n,&m),n+m)
{
for(i=1;i<=n;i++)
{
visit[i] = 1;
minload[i] = inf;
for(j=1;j<=n;j++)
map[i][j] = inf;
}
while(m--)
{
scanf("%d%d%d",&a,&b,&dis);
map[a][b] = map[b][a] = dis;
}
start = 1;
minload[start] = 0;
visit[start] = 0;
while(start != n)
{
min = inf;
for(i=1;i<=n;i++)
{
if(map[start][i]!=inf)
minload[i] = Min(minload[i],map[start][i]+minload[start]);
if(visit[i] && minload[i]<min)
{
next = i;
min = minload[i];
}
}
start = next;
visit[start] = 0;
}
printf("%d\n",minload[n]);
}
return 0;
}
修改了一下，这个效率高一点
每个minload[n]代表n到起点的最短距离
posted on 2009-02-15 14:23
shǎ崽 阅读(473)
评论(2) 编辑 收藏 引用