HDU 2544 dijkstra模板题

让楼主非常郁闷.....差不多的代码，我用C++交就wa，g++就过了....害的改了好多次...

#include <iostream>
#include <cstring>
#define INF 1000000
#define INT_MAX 0x3f3f3f3f   //本来用的limit里面的东西..
using namespace std;
const int maxn = 100;
int a[maxn][maxn];
int pre[maxn];
int dis[maxn];
int n,m;
void dijkstra(int start){
    bool vis[maxn];
    for(int i = 1; i <= n; ++i){
        dis[i] = a[start][i];
        vis[i] = false;
        if(a[start][i] == INT_MAX){
            pre[i] = -1;
        }else pre[i] = start;
    }
    dis[start] = 0;
    vis[start] = true;
    for(int i = 2; i <= n; ++i){
        int mindist = INT_MAX;
        int u = start;
        for(int j = 1; j <= n; ++j){
            if(!vis[j] && dis[j] < mindist){
                u = j;
                mindist = dis[j];
            }
        }
        vis[u] = true;
        for(int j = 1; j <= n ; ++j){
            if(!vis[j] && a[u][j]<INT_MAX)
                if(dis[u] + a[u][j] < dis[j]){
                    dis[j] = dis[u] + a[u][j];
                    pre[j] = u;
                }
        }
    }
    cout << dis[n] << endl;
}
int main()
{
    while(cin>>n>>m){
        if(n==0 && m==0) break;
        for(int i = 1; i <= n; ++i){
            for(int j = 1; j <= n; ++j){
                if(i==j) a[i][j] = 0;
                else a[i][j] = INT_MAX;
            }
        }
        while(m--){
            int start,end,val;
            cin>>start>>end>>val;
            if(val < a[start][end])
            a[start][end] = a[end][start] = val;
        }
        dijkstra(1);
    }
    return 0;
}