floyd
zugofn
这个作者很懒,什么都没留下…
展开
-
HDU:1869 六度分离(floyd最短路径算法打表)
六度分离Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8013 Accepted Submission(s): 3283Problem Description1967年,美国著名的社会学家斯坦利·米尔原创 2016-08-04 21:01:05 · 955 阅读 · 0 评论 -
HDU:1596 find the safest road(floyd最短路径算法+打表)
find the safest roadTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11634 Accepted Submission(s): 4111Problem DescriptionXX星原创 2016-08-04 21:08:59 · 478 阅读 · 0 评论 -
HDU:2112 HDU Today(floyd求最短路径+变形题)
HDU TodayTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 25301 Accepted Submission(s): 6116Problem Description经过锦囊相助,海东集团终于度原创 2016-08-04 21:50:33 · 1059 阅读 · 0 评论 -
HDU:5636 Shortest Path(floyd+思维+技巧+最短路径)
Shortest PathTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1598 Accepted Submission(s): 520Problem DescriptionThere is a原创 2016-08-24 12:07:53 · 382 阅读 · 0 评论 -
HDU:5636 Shortest Path(floyd+最短路径)
Shortest PathTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1598 Accepted Submission(s): 520Problem DescriptionThere is a原创 2016-08-24 13:43:33 · 300 阅读 · 0 评论 -
九度OJ:1343 城际公路网(特定情况下的floyd优化)
题目1343:城际公路网时间限制:1 秒内存限制:32 兆特殊判题:否提交:504解决:197题目描述:为了加快城市之间的通行和物资流动速度,A国政府决定在其境内的N个大中型城市之间,增加修建K条公路。已知这N个城市中的任意两个都能相互连通,且已知其最短的路径长度。为了时刻监测修建新路对A国城市的影响,特任命你为观察员,负责在每修建完原创 2016-08-12 16:34:00 · 525 阅读 · 0 评论 -
HDU:1599 find the mincost route(floyd+无向图最小环)
find the mincost routeTime Limit: 1000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4313 Accepted Submission(s): 1732Problem Description杭州有原创 2016-08-24 21:33:53 · 1619 阅读 · 0 评论 -
Codeforces 500B:New Year Permutation(并查集||Floyd+思维)
B. New Year Permutationtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputUser ainta has a permutation p1, p2原创 2016-09-28 22:15:00 · 340 阅读 · 0 评论