最短路径
Lngxling
这个作者很懒,什么都没留下…
展开
-
POJ - 2387 Til the Cows Come Home —— dijkstra
Til the Cows Come HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 58996 Accepted: 20088DescriptionBessie is out in the field and wants to get back原创 2017-09-14 21:20:15 · 216 阅读 · 0 评论 -
HDU - 2962 Trucking —— 最短路加条件
TruckingTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11544 Accepted Submission(s): 1127 Problem DescriptionA certain local trucki...原创 2018-08-28 13:48:19 · 223 阅读 · 0 评论 -
POJ - 3255 Roadblocks —— 次短路
RoadblocksTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 17711 Accepted: 6210DescriptionBessie has moved to a small farm and sometimes enjoys returning to visit one of her best friends. She...原创 2018-03-11 19:55:49 · 205 阅读 · 0 评论 -
HDU - 2066 一个人的旅行 —— dijkstra
一个人的旅行Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 40843 Accepted Submission(s): 13886Problem Description虽然草儿是个路痴(就是在杭电待了一原创 2017-09-17 09:50:24 · 193 阅读 · 0 评论 -
HDU - 3790 最短路径问题 —— dijkstra
最短路径问题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 29757 Accepted Submission(s): 8822Problem Description给你n个点,m条无向边,每条边都有长原创 2017-09-17 09:41:14 · 241 阅读 · 0 评论 -
POJ - 3268 Silver Cow Party —— dijkstra
Silver Cow PartyTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 24432 Accepted: 11122DescriptionOne cow from each of N farms (1 ≤ N ≤ 1000) convenient原创 2017-09-17 09:31:19 · 190 阅读 · 0 评论 -
POJ - 1062 昂贵的聘礼 —— dijkstra
昂贵的聘礼Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 51209 Accepted: 15327Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿原创 2017-09-14 21:27:07 · 233 阅读 · 0 评论 -
POJ - 1502 MPI Maelstrom —— dijkstra
MPI MaelstromTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 10311 Accepted: 6339DescriptionBIT has recently taken delivery of their new supercomputer原创 2017-09-14 21:25:50 · 194 阅读 · 0 评论 -
HDU - 2112 HDU Today —— dijkstra
HDU TodayTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 31883 Accepted Submission(s): 7768Problem Description经过锦囊相助,海东集团终于度原创 2017-09-14 21:21:56 · 181 阅读 · 0 评论 -
POJ - 3159 Candies —— 差分约束最短路
题意:一群人分糖果,有m个限制关系,每个关系表明B所拥有的糖果数不能比A多C,问第一个人和第二个人的糖果最多能差多少。思路:差分约束,对于每个限制关系,B-A<=C,那么就从A到B建一条边,跑最短路即可本来是很简单的差分约束,但是就是死活过不了,必须用vecter优化, v.clear(); v.resize(n+1); 学到了...#include <io...原创 2018-08-29 10:33:06 · 326 阅读 · 1 评论