pku 3463 dijkstra求次短路
摘要：
#include <iostream>#include <vector>using namespace std;const int MAXN = 1010;const int INF = 2100000000;typedef pair<int, int> PAIR;vector < PAIR > map[MAXN];int dist[MAXN][2]... 阅读全文
posted @ 2009-07-31 18:01 ZAFU_VA 阅读(929) 评论(0) 推荐(0)
浙公网安备 33010602011771号