最短路及其拓展
文章平均质量分 87
mengxiang000000
这个作者很懒,什么都没留下…
展开
-
杭电 3665 Seaside(最短路)(弗洛伊德过)
无脑模板题~SeasideTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1452 Accepted Submission(s): 1055Problem DescriptionXiaoY原创 2015-12-13 19:18:21 · 784 阅读 · 0 评论 -
杭电2122 HDU Today (最短路 dijkstra 过)
HDU TodayTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 21353 Accepted Submission(s): 5094Problem Description经过锦囊相助,海东集团终于度原创 2015-12-28 19:39:34 · 983 阅读 · 0 评论 -
哈理工OJ 1802 游骑兵出动(floyd过)(最短路)
游骑兵出动Time Limit: 3000 MSMemory Limit: 32768 KTotal Submit: 24(11 users)Total Accepted: 12(11 users)Rating: Special Judge: NoDescription吉姆雷诺的原创 2016-01-13 14:02:28 · 779 阅读 · 0 评论 -
杭电oj1869 六度分离(SPFA floyd详解)
六度分离Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6790 Accepted Submission(s): 2737Problem Description1967年,美国著名的社会学家斯坦利·米尔原创 2015-12-18 11:33:16 · 964 阅读 · 0 评论 -
杭电 2544 最短路(bellman详解)
首先介绍一下bellman算法:Bellman-ford算法是求含负权图的单源最短路径算法,效率很低,但代码很容易写。即进行持续地松弛(原文是这么写的,为什么要叫松弛,争议很大),每次松弛把每条边都更新一下,若n-1次松弛后还能更新,则说明图中有负环,无法得出结果,否则就成功完成。Bellman-ford算法有一个小优化:每次松弛先设一个标识flag,初值为FALSE,若有边更新则赋值为TRU原创 2015-12-11 17:14:09 · 1923 阅读 · 0 评论 -
杭电2066 一个人的旅行(最短路)(floyd)
无论如何 求最短路的题我总是想试一试floyd算法0.0第一发还是因为1000^3的复杂度TLE了一发 不过后来还是通过小小的剪枝的技巧AC了~首先先介绍一下弗洛伊德算法0.0Floyd算法(Floyd-Warshall algorithm)又称为弗洛伊德算法、插点法,是解决给定的加权图中顶点间的最短路径的一种算法,可以正确处理有向图或负权的最短路径问题,同时也被用于计算有向图的传原创 2015-12-08 14:55:03 · 953 阅读 · 0 评论 -
杭电3790 最短路径问题(djstra过)
最开始看到这个题还是直接想的弗洛伊德算法去解.虽然是O(n^3)的时间复杂度0.0还是大胆的试了一发(其实最开始看着1000^3的复杂度就已经怂了)撞一发试了一下 果然TLE- -蓝后默默的准备djstra的模板.......这里先介绍一下dijstra.dijstra是一种解最短路问题比较常用的算法(以下是个人理解,有错误的地方欢迎指导(毕竟新手))先找到一条最短路径~(从起点到原创 2015-12-08 14:01:48 · 1229 阅读 · 0 评论 -
hdu 5326(floyd递推人际关系过)
Work Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1303 Accepted Submission(s): 791Problem Description~It’s an intere原创 2016-01-23 18:19:01 · 447 阅读 · 0 评论 -
杭电OJ2680(dijkstra)choose the best route
Choose the best routeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11170 Accepted Submission(s): 3627Problem DescriptionOne原创 2015-12-23 13:23:46 · 913 阅读 · 0 评论 -
hrbust 哈理工OJ 2133 最快通过【dijkstra过】
最快通过Time Limit: 6000 MSMemory Limit: 32768 KTotal Submit: 35(12 users)Total Accepted: 13(11 users)Rating: Special Judge: NoDescriptionsp省有n个城市原创 2016-02-11 15:13:26 · 670 阅读 · 0 评论 -
POJ3660 Cow Contest(floyd算法应用)
Cow ContestTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8767 Accepted: 4933DescriptionN (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are partici原创 2016-01-11 18:08:59 · 661 阅读 · 0 评论 -
CodeForces 25C Roads in Berland【floyd过】
Roads in BerlandDescription There are n cities numbered from 1 to n in Berland. Some of them are connected by two-way roads. Each road has its own length — an integer number from 1 to 1000. It原创 2016-02-17 15:21:07 · 1339 阅读 · 0 评论 -
hrbust 哈理工oj 1352 中间的球【floyd递推关系过】
中间的球Time Limit: 1000 MSMemory Limit: 32767 KTotal Submit: 98(38 users)Total Accepted: 49(36 users)Rating: Special Judge: NoDescription有N个外形一原创 2016-02-21 13:53:36 · 507 阅读 · 0 评论 -
hrbust 2025 确定大小【floyd递推关系过】
确定大小Time Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 54(18 users)Total Accepted: 16(15 users)Rating: Special Judge: NoDescription现在有N个字原创 2016-02-23 19:27:14 · 544 阅读 · 0 评论 -
ZOJ 3710 Friends【floyd思想递推】
FriendsTime Limit: 2 Seconds Memory Limit: 65536 KBAlice lives in the country where people like to make friends. The friendship is bidirectional and if any two person have no less than原创 2016-04-02 18:09:34 · 765 阅读 · 0 评论 -
哈理工oj/hrbust 2122 旅行【dij+优先队列优化+邻接表+map】
hrbust 2122,哈理工oj 2122原创 2016-03-12 12:45:32 · 783 阅读 · 0 评论 -
POJ 3767 I Wanna Go Home【最短路floyd】
I Wanna Go HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3371 Accepted: 1445DescriptionThe country is facing a terrible civil war----cities in t原创 2016-04-10 12:06:27 · 493 阅读 · 0 评论 -
hdu 1317 XYZZY【BellmanFord+Floyd】
XYZZYTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4356 Accepted Submission(s): 1231Problem DescriptionIt has recently been dis原创 2016-05-24 18:41:25 · 407 阅读 · 0 评论 -
hdu 4284 Travel【floyd+DFS+全文翻译】
TravelTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4008 Accepted Submission(s): 1057Problem Description PP loves travel. Her原创 2016-04-05 23:06:51 · 591 阅读 · 0 评论 -
hdu 1546 Idiomatic Phrases Game【dijkstra】
Idiomatic Phrases GameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3014 Accepted Submission(s): 973Problem DescriptionTom原创 2016-03-25 14:51:28 · 494 阅读 · 0 评论 -
hdu 1690 Bus System【floyd】
hdu 1690,杭电 1690原创 2016-03-15 21:59:12 · 428 阅读 · 0 评论 -
hdu 3357 Stock Chase【floyd判成环】
Stock ChaseTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1589 Accepted Submission(s): 485Problem DescriptionI have to admit原创 2016-03-10 15:58:05 · 632 阅读 · 0 评论 -
hdu 5636 Shortest Path【floyd+思维】
Shortest PathTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 528 Accepted Submission(s): 171Problem DescriptionThere is a path原创 2016-03-06 12:35:33 · 564 阅读 · 0 评论 -
hdu 1385 Minimum Transport Cost【floyd过】【最短路】
Minimum Transport CostTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9448 Accepted Submission(s): 2512Problem DescriptionThe原创 2016-03-03 20:48:12 · 409 阅读 · 0 评论 -
hdu 1217/poj 2240 Arbitrage【floyd】
ArbitrageTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6465 Accepted Submission(s): 2985Problem DescriptionArbitrage is the use原创 2016-05-04 16:27:54 · 507 阅读 · 0 评论 -
POJ 1125 Stockbroker Grapevine【floyd】
Stockbroker GrapevineTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 33381 Accepted: 18392DescriptionStockbrokers are known to overrea原创 2016-05-30 16:25:28 · 360 阅读 · 0 评论 -
hdu 1245 Saving James Bond【floyd】
Saving James BondTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2954 Accepted Submission(s): 579Problem DescriptionThis time let原创 2016-05-31 18:04:15 · 426 阅读 · 0 评论 -
POJ 1094 Sorting It All Out【floyd传递闭包+拓扑排序】
Sorting It All OutTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 31994 Accepted: 11117DescriptionAn ascending sorted sequence of dist原创 2016-05-08 15:21:47 · 1410 阅读 · 0 评论 -
POJ 1364 King【差分约束+SPFA/Bellman-Ford】
KingTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11846 Accepted: 4325DescriptionOnce, in one kingdom, there was a queen and that qu原创 2016-06-01 16:51:29 · 727 阅读 · 0 评论 -
POJ 3249 Test for Job【SPFA】
Test for JobTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 10381 Accepted: 2421DescriptionMr.Dog was fired by his company. In order t原创 2016-06-01 19:29:26 · 445 阅读 · 0 评论 -
POJ 3249 Test for Job【DAG图上的最短路问题】
Test for JobTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 10381 Accepted: 2421DescriptionMr.Dog was fired by his company. In order t原创 2016-06-01 20:09:58 · 644 阅读 · 0 评论 -
hdu 1535 Invitation Cards【SPFA】
Invitation CardsTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3282 Accepted Submission(s): 1523Problem DescriptionIn the age o原创 2016-06-01 21:08:02 · 692 阅读 · 0 评论 -
hdu 3592 World Exhibition 【差分约束+SPFA】
World ExhibitionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1523 Accepted Submission(s): 759Problem DescriptionNowadays, many原创 2016-06-02 13:06:51 · 654 阅读 · 0 评论 -
hdu 2807 The Shortest Path【暴力/矩阵判等优化+Floyd】
The Shortest PathTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3042 Accepted Submission(s): 995Problem DescriptionThere are N c原创 2016-06-07 13:11:18 · 407 阅读 · 0 评论 -
hdu 1595 find the longest of the shortest【最短路+枚举】
find the longest of the shortestTime Limit: 1000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2743 Accepted Submission(s): 986Problem Description原创 2016-06-07 17:24:33 · 528 阅读 · 0 评论 -
hdu 1142/hrbust 1347 A Walk Through the Forest/森林中的路【SPFA+记忆化搜索】
森林中的路Time Limit: 1000 MSMemory Limit: 32767 K Total Submit: 65(30 users)Total Accepted: 32(28 users)Rating: Special Judge: No原创 2016-06-07 20:59:54 · 530 阅读 · 0 评论 -
POJ 1734 Sightseeing trip【floyd求最小环+记录路径】
Sightseeing tripTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6010 Accepted: 2324 Special JudgeDescriptionThere is a tra原创 2016-06-03 13:50:19 · 777 阅读 · 1 评论 -
POJ 2139 Six Degrees of Cowvin Bacon【floyd】
Six Degrees of Cowvin BaconTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4317 Accepted: 2049DescriptionThe cows have been making mov原创 2016-06-03 14:18:52 · 360 阅读 · 0 评论 -
POJ 1201/hdu 1384 Intervals【差分约束+SPFA】
IntervalsTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3802 Accepted Submission(s): 1433Problem DescriptionYou are given n clo原创 2016-06-03 16:41:18 · 480 阅读 · 0 评论 -
POJ 1716 Integer Intervals【差分约束+SPFA】
Integer IntervalsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 13671 Accepted: 5824DescriptionAn integer interval [a,b], a Write a原创 2016-06-03 17:08:02 · 538 阅读 · 0 评论