随笔分类 -  BFS-广度优先搜索

速度相对DFS快了不少,特点逐层暴力求解。
摘要:非常可乐Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1190Accepted Submission(s): 500Problem Description大家一定觉的运动以后喝可乐是一件很惬意的事情,但是seeyou却不这么认为。因为每次当seeyou买了可乐以后,阿牛就要求和seeyou一起分享这一瓶可乐,而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子,它们的容量分别是N 毫升和M 毫升 可乐的体积为S (S<1 阅读全文
posted @ 2011-08-08 17:51 沐阳 阅读(1992) 评论(0) 推荐(0)
摘要:A计划Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4156Accepted Submission(s): 936Problem Description可怜的公主在一次次被魔王掳走一次次被骑士们救回来之后,而今,不幸的她再一次面临生命的考验。魔王已经发出消息说将在T时刻吃掉公主,因为他听信谣言说吃公主的肉也能长生不老。年迈的国王正是心急如焚,告招天下勇士来拯救公主。不过公主早已习以为常,她深信智勇的骑士LJ肯定能将她救出。现据密探所报,公主被 阅读全文
posted @ 2011-08-08 16:28 沐阳 阅读(1209) 评论(0) 推荐(0)
摘要:1105: Prime PathTime Limit: 1 SecMemory Limit: 128 MBSubmit: 2Solved: 2[Submit][Status][Web Board]DescriptionThe ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to change the four-digit room numbers on their offices. — It is a ma.. 阅读全文
posted @ 2011-07-29 17:00 沐阳 阅读(380) 评论(0) 推荐(0)