![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
dijcstra
coder_coder_coder
默默的程序猿
展开
-
hdu1874 Dijkstra(堆优化)+floyd
//#include #include #include #include #include #include #include #define MAXN 2510 #define MAXM 6210 using namespace std; int n,m,s,t; typedef pair PII; struct edge { int v, w; edge *next;原创 2014-08-19 22:50:25 · 410 阅读 · 0 评论 -
hdu2112HDU Today trie+map
trie #include #include #include #include #include #include #include #define MAXN 50010 #define MAXM 50010 using namespace std; int chd[MAXN][26];//存储节点编号 int v[MAXN];//串尾节点标记//对于map为int v[][]原创 2014-08-20 23:26:14 · 403 阅读 · 0 评论