==图论==
林次次
Life is short, use Python.
展开
-
HDU 5137:How Many Maos Does the Guanxi Worth【Floyd】
How Many Maos Does the Guanxi Worth Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others) Total Submission(s): 1054 Accepted Submission(s): 369 Problem Descri原创 2015-08-24 14:28:32 · 664 阅读 · 0 评论 -
HDU 4857:逃生【拓扑】
逃生 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2416 Accepted Submission(s): 680 Problem Description 糟糕的事情发生啦,现在大家都忙着逃命。但是逃命的通道很窄原创 2015-08-19 21:05:58 · 612 阅读 · 0 评论 -
HDU 2680:Choose the best route【Dijkstra & SPFA】
Choose the best route Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 10287 Accepted Submission(s): 3317 Problem Description One day原创 2015-08-17 16:45:17 · 790 阅读 · 0 评论 -
POJ 3259:Wormholes 【SPFA】
Wormholes Time Limit : 4000/2000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other) Total Submission(s) : 6 Accepted Submission(s) : 6 Problem Description While exploring his many far原创 2015-08-19 18:19:29 · 1018 阅读 · 0 评论 -
Bellman-Ford 算法及其优化以及SPFA
Bellman-Ford算法与另一个非常著名的Dijkstra算法一样,用于求解单源点最短路径问题。Bellman-ford算法除了可求解边权均非负的问题外,还可以解决存在负权边的问题(意义是什么,好好思考),而Dijkstra算法只能处理边权非负的问题,因此 Bellman-Ford算法的适用面要广泛一些。但是,原始的Bellman-Ford算法时间复杂度为 O(VE),比Dijkstra算转载 2015-08-20 09:39:31 · 714 阅读 · 0 评论 -
HDU 4324:Triangle LOVE【拓扑排序】
Triangle LOVE Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 3692 Accepted Submission(s): 1455 Problem Description Recently, scient原创 2015-08-20 13:45:28 · 788 阅读 · 0 评论 -
HDU 1874:畅通工程续【Dijkstra & SPFA & Floyd】
畅通工程续 Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 36543 Accepted Submission(s): 13423 Problem Description 某省自从实行了很多年的畅通工程计划后,终于修原创 2015-08-17 11:14:12 · 667 阅读 · 0 评论 -
HDU 1869:六度分离【Dijsktra & SPFA & Floyd】
六度分离 Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5665 Accepted Submission(s): 2293 Problem Description 1967年,美国著名的社会学家斯坦利·米尔格兰姆提原创 2015-08-17 16:09:39 · 653 阅读 · 0 评论 -
HDU 1385:Minimum Transport Cost【Floyd】
Minimum Transport Cost Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 8793 Accepted Submission(s): 2310 Problem Description These a原创 2015-08-21 16:59:22 · 656 阅读 · 0 评论 -
HDU 2066:一个人的旅行【Dijkstra & SPFA & Floyd】
一个人的旅行 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 24709 Accepted Submission(s): 8557 Problem Description 虽然草儿是个路痴(就是在杭电待了一年多,居然原创 2015-08-18 10:26:16 · 736 阅读 · 0 评论 -
HDU 2112:HDU Today【Dijkstra & SPFA & Floyd】
HDU Today Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 19635 Accepted Submission(s): 4615 Problem Description 经过锦囊相助,海东集团终于度过了危机原创 2015-08-18 11:45:15 · 536 阅读 · 0 评论 -
HDU 1596:find the safest road【Dijkstra & SPFA】
find the safest road Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 9078 Accepted Submission(s): 3191 Problem Description XX星球有很多城原创 2015-08-17 12:33:57 · 424 阅读 · 0 评论 -
HDU 1285:确定比赛名次 【拓扑排序】
确定比赛名次 Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 37 Accepted Submission(s) : 28 Problem Description 有N个比赛队(1 Input 输入有若干组,每原创 2015-08-14 11:28:11 · 555 阅读 · 0 评论 -
HDU2544:最短路【Dijkstra & SPFA】
最短路 Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 42585 Accepted Submission(s): 18653 Problem Description 在每年的校赛里,所有进入决赛的同学都会获得一原创 2015-08-17 11:51:31 · 631 阅读 · 0 评论 -
HDU1879:继续畅通工程【kruskal】
继续畅通工程 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 17839 Accepted Submission(s): 7681 Problem Description 省政府“畅通工程”的目标是使全省任何两个村庄原创 2015-08-11 15:10:59 · 701 阅读 · 0 评论 -
HDU 1301:Jungle Roads【Prim】
Jungle Roads Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5516 Accepted Submission(s): 3981 Problem Description The Head El原创 2015-08-12 16:32:36 · 674 阅读 · 0 评论 -
HDU 1248:寒冰王座【Floyd & 完全背包】
寒冰王座 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 13181 Accepted Submission(s): 6722 Problem Description 不死族的巫妖王发工资拉,死亡骑士拿到一张N元的钞原创 2015-08-21 14:25:47 · 660 阅读 · 0 评论 -
HDU1875:畅通工程再续【Kruskal & Prim】
畅通工程再续 Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other) Total Submission(s) : 58 Accepted Submission(s) : 25 Problem Description 相信大家都听说一个“百岛湖”的地方吧,百岛湖的居民生活在不同的小原创 2015-08-11 19:03:50 · 511 阅读 · 0 评论 -
POJ 1789:Truck History 【Prim】
Truck History Time Limit : 4000/2000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other) Total Submission(s) : 123 Accepted Submission(s) : 36 Problem Description Advanced Cargo Movement原创 2015-08-13 09:13:10 · 804 阅读 · 0 评论 -
HDU 1102:Constructing Roads【Kruskal & Prim】
Constructing Roads Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 17214 Accepted Submission(s): 6538 Problem Description There are原创 2015-08-11 21:26:40 · 477 阅读 · 0 评论 -
HDU1863:畅通工程【Kruskal & Prim】
畅通工程 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 21271 Accepted Submission(s): 9154 Problem Description 省政府“畅通工程”的目标是使全省任何两个村庄间都原创 2015-08-11 10:18:55 · 682 阅读 · 0 评论 -
ZOJ 2048 :Highways 【Prim】
Highways Time Limit : 2000/1000ms (Java/Other) Memory Limit : 20000/10000K (Java/Other) Total Submission(s) : 11 Accepted Submission(s) : 7 Special Judge Problem Description The island nati原创 2015-08-13 17:52:00 · 875 阅读 · 0 评论 -
POJ 2075:Tangled in Cables 【Prim】
Tangled in Cables Time Limit : 2000/1000ms (Java/Other) Memory Limit : 60000/30000K (Java/Other) Total Submission(s) : 2 Accepted Submission(s) : 1 Problem Description You are the owner of Sm原创 2015-08-14 10:19:34 · 1044 阅读 · 0 评论 -
HDU 3790:最短路径问题【Dijkstra】
最短路径问题 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 17954 Accepted Submission(s): 5378 Problem Description 给你n个点,m条无向边,每条边都有长度d和花原创 2015-08-18 15:44:59 · 658 阅读 · 0 评论 -
HPU 1707:求解不等式【SPFA & 差分约束】
1707: 求解不等式 时间限制: 1 Sec 内存限制: 128 MB 提交: 11 解决: 3 [提交][状态][讨论版] 题目描述 给你X1,X2,X3,X4...Xn一共N个未知量和M个不等式。问你该不等式组有没有解。 输入 输入有多组测试数据,第一行有两个数N和M,分别表示未知量个数和不等式数目。 接下来M行,每行有四个数a,b,c,d,若d为0表示一个不原创 2015-08-21 21:26:47 · 670 阅读 · 0 评论