
Dijkstra
文章平均质量分 68
J_Sure
唯苦修深思方能顿悟
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
AHU-OJ 187 图的最短路径
图的最短路径Time Limit: 1000 ms Case Time Limit: 1000 ms Memory Limit: 64 MBTotal Submission: 172 Submission Accepted: 72Description求下图中从V1 到V10的最短路径Input输入图的邻接矩阵表示Output输出路径序列原创 2014-07-25 14:15:25 · 1210 阅读 · 0 评论 -
POJ-1135 Domino Effect
Domino EffectTime Limit: 1000MS Memory Limit: 65536KDescriptionDid you know that you can use domino bones for other things besides playing Dominoes? Take a number of dominoes原创 2014-08-11 14:07:42 · 1069 阅读 · 0 评论 -
ZOJ-1053 FDNY to the Rescue!
FDNY to the Rescue!Time Limit: 2 Seconds Memory Limit: 65536 KB The Fire Department of New York (FDNY) has always been proud of their response time to fires in New York City, but they原创 2014-08-11 20:15:09 · 1002 阅读 · 0 评论 -
ZOJ-1655 Transport Goods
Transport GoodsTime Limit: 2 Seconds Memory Limit: 65536 KB The HERO country is attacked by other country. The intruder is attacking the capital so other cities must send supports to th原创 2014-08-11 22:45:05 · 1099 阅读 · 0 评论 -
HDU-1546 Idiomatic Phrases Game
Idiomatic Phrases GameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Problem DescriptionTom is playing a game called Idiomatic Phrases Game. An idiom co原创 2014-08-11 15:54:34 · 898 阅读 · 0 评论 -
Dijkstra模板
输入N个顶点输入点u,点v以及原创 2014-08-11 10:56:55 · 896 阅读 · 0 评论 -
Dijkstra + Heap优化模板
const int N = 105;bool done[N];struct Edge { int to, w; int next;}edge[N];struct Heap { int d, u; bool operator < (const Heap &tmp) const { return d > tmp.d; }//重载'<',维护最小堆};void Dijkstr原创 2014-08-16 16:49:11 · 1118 阅读 · 1 评论 -
ZOJ-2027 Travelling Fee
Travelling FeeTime Limit: 2 Seconds Memory Limit: 65536 KBSamball is going to travel in the coming vacation. Now it's time to make a plan. After choosing the destination city, the next st原创 2014-08-15 22:31:11 · 1179 阅读 · 0 评论