hdu 2544

第一次一次提交成功！！hole in one

依旧是dijkstra

#include<stdio.h>#define N 110#define max 999999int g[N][N];int dijkstra(int s,int n){int i,j,u,min,dis[N],mark[N];for(i=0;i<n;i++){mark[i]=0;dis[i]=g[s][i];}mark[s]=1;for(i=1;i<n;i++){min=max;for(j=0;j<n;j++)if(!mark[j]&&min>dis[j]){u=j;min=dis[j];}mark[u]=1;for(j=0;j<n;j++)if(!mark[j]&&g[u][j]!=max&&dis[j]>dis[u]+g[u][j])dis[j]=dis[u]+g[u][j];}return dis[n-1];}int main(){int i,j,n,m,x,y,dis;while(scanf("%d%d",&n,&m)&&n){for(i=0;i<n;i++)for(j=0;j<n;j++)g[i][j]=max;for(i=0;i<m;i++){scanf("%d%d%d",&x,&y,&dis);if(g[x-1][y-1]>dis)g[x-1][y-1]=g[y-1][x-1]=dis;}printf("%d/n",dijkstra(0,n));}return 0;}