hdu 1142 dijkstra+记忆化搜索
摘要：
#include <iostream>using namespace std;const int MAXN = 1010;const int INF = INT_MAX;int map[MAXN][MAXN];int dist[MAXN], n, m, dp[MAXN];bool hash[MAXN];void dijkstra(int Start){ memset(hash, 0, ... 阅读全文
posted @ 2009-08-19 15:19 ZAFU_VA 阅读(505) 评论(1) 推荐(1) 编辑
