![](https://img-blog.csdnimg.cn/20201014180756757.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
最短路-Dijkstra
不要再见
年轻且优秀,积极且颓废
展开
-
POJ - 2387 Til the Cows Come Home
Language:DefaultTil the Cows Come HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 63982 Accepted: 21612DescriptionBessie is out in the field and wants to get back to the barn to get as m...原创 2018-02-27 20:40:28 · 169 阅读 · 0 评论 -
HDU - 2544 最短路
最短路Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 77383 Accepted Submission(s): 33620Problem Description在每年的校赛里,所有进入决赛的同学都会获得一件很漂亮的t-shirt。但...原创 2018-02-27 21:34:49 · 148 阅读 · 0 评论 -
HDU - 1874 畅通工程续
畅通工程续Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 62135 Accepted Submission(s): 23309Problem Description某省自从实行了很多年的畅通工程计划后,终于修建了很多路。不过路多了也...原创 2018-03-01 18:53:36 · 191 阅读 · 0 评论 -
Dijkstra多权值
转载。 https://blog.csdn.net/henuwhr/article/details/79318730多边权一般有三种 1 路径多条边权2 增加点权3 直接询问有多少条最短路这就是Dijkstra的变形, 注意在这三种都是在最短路的基础上的,比如增加边权花费, 问在如果有多条最短路径情况下 最小花费是多少, 或者增加点权, 每个顶点都有一定物资,询问有多条最短路的情况下物资最多为多少...转载 2018-03-24 17:11:37 · 610 阅读 · 0 评论 -
POJ-3268 Silver Cow Party
Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 28088 Accepted: 12756 DescriptionOne cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to att...转载 2018-07-19 10:43:13 · 104 阅读 · 0 评论