随笔分类 -  搜索:BFS

只有注册用户登录后才能阅读该文。
posted @ 2019-01-15 21:18 DWVictor 阅读(36) 评论(0) 推荐(0)
摘要:链接:https://ac.nowcoder.com/acm/contest/338/B来源:牛客网 题目描述 Sleeping is a favorite of little bearBaby, because the wetness of Changsha in winter is too un 阅读全文
posted @ 2019-01-06 19:25 DWVictor 阅读(399) 评论(0) 推荐(0)
摘要:深度优先搜索和广度优先搜索的深入讨论 (一)深度优先搜索的特点是: (1)无论问题的内容和性质以及求解要求如何不同,它们的程序结构都是相同的,即都是深度优先算法(一)和深度优先算法(二)中描述的算法结构,不相同的仅仅是存储结点数据结构和产生规则以及输出要求。 (2)深度优先搜索法有递归以及非递归两种 阅读全文
posted @ 2018-12-01 10:42 DWVictor 阅读(7736) 评论(0) 推荐(2)
摘要:Pots Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7783 Accepted: 3261 Special Judge Description You are given two pots, having the volum 阅读全文
posted @ 2018-12-01 10:34 DWVictor 阅读(932) 评论(0) 推荐(0)
摘要:You are given two pots, having the volume of A and B liters respectively. The following operations can be performed: FILL(i) fill the pot i (1 ≤ i ≤ 2 阅读全文
posted @ 2018-11-29 10:35 DWVictor 阅读(643) 评论(0) 推荐(0)
摘要:You are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock. 阅读全文
posted @ 2018-11-29 10:30 DWVictor 阅读(595) 评论(0) 推荐(0)
摘要:Cleaning Robot (bfs+dfs) Here, we want to solve path planning for a mobile robot cleaning a rectangular room floor with furniture. Consider the room f 阅读全文
posted @ 2018-11-29 10:27 DWVictor 阅读(436) 评论(0) 推荐(0)