hdu 2544 最短路
摘要:
http://acm.hdu.edu.cn/showproblem.php?pid=2544#include#include#include#includeusing namespace std;const int N =105;const int INF = 0x3f3f3f3f;int map[N][N],dis[N];bool vis[N];int n,m;void init(){ int i , j; memset(map,INF,sizeof(map)); for(i = 1; i cost)map[vi][vj]=map[vj][vi]=cost; }}/*... 阅读全文
posted @ 2013-07-30 11:02 blieveboy 阅读(98) 评论(0) 推荐(0) 编辑