![](https://img-blog.csdnimg.cn/20201014180756926.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
最短路径
Reast1nPeace
NUC acm/icpc
展开
-
最短路 floyd变形 POJ-2253
题目:FroggerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 51723 Accepted: 16420DescriptionFreddy Frog is sitting on a stone in the middle of a lake.原创 2018-01-24 09:55:13 · 256 阅读 · 0 评论 -
最短路 Dijkstra HDU-2544
题目:最短路Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 75154 Accepted Submission(s): 32660Problem Description在每年的校赛里,所有进入决赛的同学原创 2018-01-24 10:39:42 · 259 阅读 · 0 评论 -
最短路 Invitation Cards POJ - 1511
题目:Invitation CardsTime Limit: 8000MS Memory Limit: 262144KTotal Submissions: 30192 Accepted: 10077DescriptionIn the age of television, not many people attend原创 2018-02-03 09:43:37 · 265 阅读 · 0 评论 -
弗洛伊德算法模板 All Pairs Shortest Path Aizu - GRL_1_C
题目:InputAn edge-weighted graph G (V, E). |V| |E|s0 t0 d0s1 t1 d1:s|E|-1 t|E|-1 d|E|-1|V| is the number of vertices and |E| is the number of edges inG. The graph vertices are named w原创 2018-01-20 00:59:28 · 647 阅读 · 0 评论 -
[kuangbin带你飞]专题4 最短路 A - Til the Cows Come Home POJ - 2387
题目:Til the Cows Come HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 61857 Accepted: 20985DescriptionBessie is out in the field and wants to get原创 2018-01-20 00:58:34 · 271 阅读 · 0 评论 -
迪杰斯特拉算法模板/三种图的存储模板 Single Source Shortest Path II Aizu - ALDS1_12_C
题目:Single Source Shortest Path IIFor a given weighted graph G=(V,E), find the shortest path from a source to each vertex. For each vertex u, print the total weight of edges on the shor原创 2018-01-20 10:21:47 · 554 阅读 · 0 评论 -
POJ 3255 求次短路径
题目:RoadblocksTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 18020 Accepted: 6338DescriptionBessie has moved to a small farm and sometimes enjoys returning to visit one of her best friends. ...原创 2018-04-05 17:18:32 · 222 阅读 · 0 评论 -
Aizu - 2200 AOJ floyd+dp
题意:你是某个岛国(ACM-ICPC Japan)上的一个苦逼程序员,你有一个当邮递员的好基友利腾桑遇到麻烦了:全岛有一些镇子通过水路和旱路相连,走水路必须要用船,在X处下船了船就停在X处。而且岛上只有一条船,下次想走水路还是得回到X处才行;两个镇子之间可能有两条以上的水路或旱路;邮递员必须按照清单上的镇子顺序送快递(镇子可能重复,并且对于重复的镇子不允许一次性处理,比如ABCB的话B一定要按顺序...原创 2018-04-24 21:51:33 · 421 阅读 · 0 评论 -
poj3662 Telephone Lines 二分答案+最短路
题目:Telephone LinesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8178 Accepted: 2948DescriptionFarmer John wants to set up a telephone line at his farm. Unfortunately, the phone company is ...原创 2018-04-26 20:51:00 · 493 阅读 · 0 评论