随笔分类 -  ...图论~最短路

Risk（最短路）
摘要：Risk Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 2915 Accepted: 1352 Description Risk is a board game in which several opposing players 阅读全文
posted @ 2016-03-05 22:16 handsomecui 阅读(251) 评论(0) 推荐(0) 编辑
第八届河南省赛C.最少换乘（最短路建图）
摘要：C.最少换乘Time Limit:2 SecMemory Limit:128 MB Submit:94Solved:25 [Submit][Status][Web Board]Description欧洲某城是一个著名的旅游胜地，每年都有成千上万的人前来观光旅行。Dr. Kong决定利用暑假好好游览一... 阅读全文
posted @ 2016-01-01 22:29 handsomecui 阅读(335) 评论(1) 推荐(1) 编辑
Part Acquisition(spfa输出路径)
摘要：Part AcquisitionTime Limit:1000MSMemory Limit:65536KTotal Submissions:4080Accepted:1742Special JudgeDescriptionThe cows have been sent on a mission th... 阅读全文
posted @ 2015-11-28 20:05 handsomecui 阅读(638) 评论(0) 推荐(0) 编辑
In Action（最短路+01背包）
摘要：In ActionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4764Accepted Submission(s): 1569Problem D... 阅读全文
posted @ 2015-11-01 17:56 handsomecui 阅读(307) 评论(0) 推荐(0) 编辑
城市平乱(Bellman)
摘要：城市平乱时间限制：1000 ms | 内存限制：65535 KB 难度：4描述南将军统领着N个部队，这N个部队分别驻扎在N个不同的城市。他在用这N个部队维护着M个城市的治安，这M个城市分别编号从1到M。现在，小工军师告诉南将军，第K号城市发生了暴乱，南将军从各个部队都派遣了一个分队沿最近路去往暴乱城... 阅读全文
posted @ 2015-09-24 16:13 handsomecui 阅读(135) 评论(0) 推荐(0) 编辑
NYOJ 7-街区最短路径问题(曼哈顿距离)
摘要：街区最短路径问题时间限制：3000 ms | 内存限制：65535 KB 难度：4描述一个街区有很多住户，街区的街道只能为东西、南北两种方向。住户只可以沿着街道行走。各个街道之间的间隔相等。用(x,y)来表示住户坐在的街区。例如（4,20），表示用户在东西方向第4个街道，南北方向第20个街道。现在要... 阅读全文
posted @ 2015-09-24 14:01 handsomecui 阅读(1589) 评论(0) 推荐(0) 编辑
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): 3425Accepted Submission(s): ... 阅读全文
posted @ 2015-09-08 18:47 handsomecui 阅读(989) 评论(0) 推荐(0) 编辑
Minimum Transport Cost(floyd+二维数组记录路径)
摘要：Minimum Transport CostTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8860Accepted Submission(s): ... 阅读全文
posted @ 2015-08-24 10:32 handsomecui 阅读(318) 评论(0) 推荐(0) 编辑
Wormholes(SPFA+Bellman)
摘要：WormholesTime Limit:2000MSMemory Limit:65536KTotal Submissions:36860Accepted:13505DescriptionWhile exploring his man... 阅读全文
posted @ 2015-08-21 09:59 handsomecui 阅读(247) 评论(0) 推荐(0) 编辑
How Many Maos Does the Guanxi Worth
摘要：How Many Maos Does the Guanxi WorthTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 864Accepted S... 阅读全文
posted @ 2015-08-17 21:59 handsomecui 阅读(231) 评论(0) 推荐(0) 编辑
Choose the best route
摘要：Choose the best routeTime Limit : 2000/1000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 12Accepted Submission(s) : 6Pr... 阅读全文
posted @ 2015-08-17 19:56 handsomecui 阅读(313) 评论(0) 推荐(0) 编辑
find the safest road
摘要：find the safest roadTime Limit : 10000/5000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 23Accepted Submission(s) : 12P... 阅读全文
posted @ 2015-08-17 19:54 handsomecui 阅读(435) 评论(0) 推荐(0) 编辑
畅通工程续(dijskra+SPFA)
摘要：畅通工程续Time Limit : 3000/1000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 67Accepted Submission(s) : 37Problem Descripti... 阅读全文
posted @ 2015-08-17 19:51 handsomecui 阅读(367) 评论(0) 推荐(0) 编辑
最短路（dijskra+SPFA+Bellman）
摘要：最短路Time Limit : 5000/1000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 82Accepted Submission(s) : 51Problem Description... 阅读全文
posted @ 2015-08-17 19:50 handsomecui 阅读(821) 评论(0) 推荐(0) 编辑
HDU Today（dijskra）
摘要：HDU TodayTime Limit: 15000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 19475Accepted Submission(s): 4574Problem... 阅读全文
posted @ 2015-08-17 17:46 handsomecui 阅读(228) 评论(0) 推荐(0) 编辑
一个人的旅行(floyd+dijskra+SPFA+Bellman)
摘要：一个人的旅行Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 23416Accepted Submission(s): 8154Problem Des... 阅读全文
posted @ 2015-07-23 17:30 handsomecui 阅读(327) 评论(0) 推荐(0) 编辑
六度分离（floyd算法+dijskra+SPFA）
摘要：六度分离Time Limit: 5000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5411Accepted Submission(s): 2195Problem Descri... 阅读全文
posted @ 2015-07-23 16:20 handsomecui 阅读(748) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示