最短路复习
摘要：
HDU 1874 1.dijkstra 算法View Code #include<stdio.h>#include<string.h>#include<stdlib.h>#include<algorithm>using namespace std;const int inf = 0x7f7f7f7f;int mp[400][400];int visit[400];int dis[400];int S, T;void dij( int N ){ for( int i = 0; i < N; i++) { visit[i] = 0; dis[i 阅读全文
posted @ 2012-03-13 14:11 more think, more gains 阅读(138) 评论(0) 推荐(0) 编辑
