BFS
莫宫天
莫愁前路无知己,天下谁人不识君。
展开
-
HDU - 3533----Escape(BFS+预处理)
The students of the HEU are maneuvering for their military training. The red army and the blue army are at war today. The blue army finds that Little A is the spy of the red army, so Little A has to原创 2017-02-05 20:53:29 · 342 阅读 · 0 评论 -
FZU - 2150----Fire Game(BFS+枚举)
Fat brother and Maze are playing a kind of special (hentai) game on an N*M board (N rows, M columns). At the beginning, each grid of this board is consisting of grass or just empty and then they start原创 2017-02-02 21:03:41 · 454 阅读 · 0 评论 -
POJ - 3414----Pots
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) from the tap; DROP(i) empty the pot i原创 2017-02-02 20:42:47 · 392 阅读 · 0 评论 -
POJ - 3126----Prime Path
The 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 matter of se原创 2017-01-30 22:07:23 · 565 阅读 · 1 评论 -
POJ - 3278----Catch That Cow
Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a number line and the cow is at a point K (0 ≤ K ≤ 100,00原创 2017-01-30 19:25:42 · 487 阅读 · 0 评论 -
POJ - 1426---Find The Multiple
Input The input file may contain multiple test cases. Each line contains a value of n (1 <= n <= 200). A line containing a zero terminates the input.Output For each value of n in the input print a li原创 2017-01-29 17:25:18 · 541 阅读 · 0 评论 -
POJ - 2251---Dungeon Master
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. It takes one minute to move one unit north, south,原创 2017-01-28 15:52:30 · 225 阅读 · 0 评论 -
非启发式搜索
简单介绍一下非启发式搜索。 非启发式搜索是一种无信息搜索,一般只适用于求解比较简单的问题,通常是按预定的搜索策略进行搜索,而不会考虑到问题本身的特性(即就是不会利用问题本身的信息)。 常用的非启发式搜索有: 1,广度优先搜索(BFS) BFS通常借用队列来完成。 主要代码思想为:一张图G中(不一定是图,只要可以抽象成图的都可以) 1:初始节点S0开始入队并设访问标记原创 2017-01-31 15:07:34 · 1906 阅读 · 0 评论 -
POJ - 3984----迷宫问题
定义一个二维数组: int maze[5][5] = {0, 1, 0, 0, 0,0, 1, 0, 1, 0,0, 0, 0, 0, 0,0, 1, 1, 1, 0,0, 0, 0, 1, 0,};它表示一个迷宫,其中的1表示墙壁,0表示可以走的路,只能横着走或竖着走,不能斜着走,要求编程序找出从左上角到右下角的最短路线。Input一个5 × 5的二维数组,表示一个迷宫。数据保证有唯一解。O原创 2017-02-04 13:45:18 · 381 阅读 · 0 评论 -
HDU - 1495-----非常可乐
大家一定觉的运动以后喝可乐是一件很惬意的事情,但是seeyou却不这么认为。因为每次当seeyou买了可乐以后,阿牛就要求和seeyou一起分享这一瓶可乐,而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子,它们的容量分别是N 毫升和M 毫升 可乐的体积为S (S<101)毫升 (正好装满一瓶) ,它们三个之间可以相互倒可乐 (都是没有刻度的,且 S==N+M,101>S>0,N>原创 2017-02-04 13:49:02 · 790 阅读 · 0 评论