POJ 1502 MPI MaeIstrom ( 裸最短路 || atoi系统函数 )

#include<bits/stdc++.h>
using namespace std;
const int maxn = 110;
const int INF  = 0x3f3f3f3f;
typedef pair<int, int> HeapNode;

struct EDGE{ int v, nxt, w; };
int Head[maxn], Dis[maxn];
EDGE Edge[maxn*maxn];
int N, cnt;
inline void init()
{
    for(int i=0; i<=N; i++)
        Head[i]=-1, Dis[i]=INF;
    cnt = 0;
}

inline void AddEdge(int from, int to, int weight)
{
    Edge[cnt].v = to;
    Edge[cnt].w = weight;
    Edge[cnt].nxt = Head[from];
    Head[from] = cnt++;
}

int Dijkstra(int st)
{
    priority_queue< HeapNode, vector<HeapNode>, greater<HeapNode> > Heap;
    Dis[st] = 0;
    Heap.push(make_pair(0, st));
    while(!Heap.empty()){
        pair<int, int> T = Heap.top(); Heap.pop();
        if(T.first != Dis[T.second]) continue;
        for(int i=Head[T.second]; i!=-1; i=Edge[i].nxt){
            int Eiv = Edge[i].v;
            if(Dis[Eiv] > Dis[T.second] + Edge[i].w){
                Dis[Eiv] = Dis[T.second] + Edge[i].w;
                Heap.push(make_pair(Dis[Eiv], Eiv));
            }
        }
    }
    int ret = 0;
    for(int i=1; i<=N; i++)
        ret = max(ret, Dis[i]);
    return ret;
}
char Digit[10];
int main(void)
{

    while(~scanf("%d", &N)){
        init();
        for(int i=1; i<=N; i++){
            for(int j=1; j<i; j++){
                scanf("%s", Digit);
                if(Digit[0] != ‘x‘){
                    int weight = atoi(Digit);
                    AddEdge(i, j, weight);
                    AddEdge(j, i, weight);
                }
            }
        }
        printf("%d\n", Dijkstra(1));
    }

    return 0;
}