题目链接:Problem - 2544
http://acm.hdu.edu.cn/showproblem.php?pid=2544
http://acm.hdu.edu.cn/showproblem.php?pid=2544
简单的模板题 ,直接套模板,再写主函数,ok !
#include<cstdio>
#include<iostream>
#include<sstream>
#include<cstdlib>
#include<cstring>
#include<string>
#include<climits>
#include<cmath>
#include<algorithm>
#include<queue>
#include<vector>
#include<stack>
#include<set>
#include<map>
using namespace std;
#define MAX 99999
#define N 10000
int edges[N][N],d[N],n;
void dijkstra(int v)
{
int i,j;
bool s[N]={false};
for(i=1;i<=n;i++)
d[i]=edges[v][i];
d[v]=0;
s[v]=true;
for(i=1;i<n;i++)
{
int temp=MAX;
int u=v;
for(j=1;j<=n;j++)
if(!s[j]&&(d[j]<temp))
{
u=j;
temp=d[j];
}
s[u]=true;
for(j=1;j<=n;j++)
if((!s[j])&&(edges[u][j]<MAX)&&(d[u]+edges[u][j])<d[j])
d[j]=d[u]+edges[u][j];
}
}
int main()
{
int i,j,m,a,b,c;
while(~scanf("%d%d",&n,&m))
{
if(n==0&&m==0)
break;
else
{
for(i=1;i<=1000;i++)
for(j=1;j<=1000;j++)
{edges[i][j]=MAX;edges[j][i]=MAX;}
for(i=1;i<=m;i++)
{
scanf("%d%d%d",&a,&b,&c);
if(edges[a][b]>c)
{
edges[a][b]=c;
edges[b][a]=c;
}
}
dijkstra(1);
printf("%d\n",d[n]);
}
}
return 0;
}