hdu 2544 最短路

Dijkstra裸算法。。。

#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
#define ll long long
#define ls rt<<1
#define rs ls1
#define lson l,mid,ls
#define rson mid+1,r,rs
#define middle (l+r)>>1
#define eps (1e-9)
#define type int
#define clr_all(x,c) memset(x,c,sizeof(x))
#define clr(x,c,n) memset(x,c,sizeof(x[0])*(n+1))
#define MOD 1000000007
#define inf 0x7fffffff
#define pi acos(-1.0)
#define M 100+5
#define NX 100000005
int ma[M][M],d[M],fn[M];
int n,m,ss,dd;
void ShortestPath() {
int i,j,v,minx;
for(i=2;i<=n;++i){
minx=NX; v=0;
for(j=1;j<=n;++j)
if(fn[j]==0&&d[j]<minx){ 
v=j;
minx=d[j];
}
fn[v]=1;
for(j=1;j<=n;++j)
if(fn[j]==0&&((d[v]+ma[v][j])<d[j])){
d[j]=d[v]+ma[v][j];
}
}
}
int main(){
    int i,j,x,y;
    while(scanf("%d %d",&n,&m)){
if(n==0||m==0)break;
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)ma[i][j]=NX;
for(i=0;i<m;++i){
scanf("%d %d %d",&x,&y,&j);
    ma[x][y]=ma[y][x]=j;
}
ss=1,dd=n;
for(i=1;i<=n;++i){
fn[i]=0;
d[i]=ma[ss][i];
}
d[ss]=0;  fn[ss]=1; 
ShortestPath();
printf("%d\n",d[dd]);
}
    return 0;
}