入门客AI创业平台(我带你入门,你带我飞行)
博客笔记

			
				POJ 2049— Finding Nemo(三维BFS)10/200
POJ 2049— Finding Nemo(三维BFS)10/200 2014-06-09
海底总动员。。。。 这个题开始不会建图,彻底颠覆以前我对广搜题的想法。想了好久, 忽然想到省赛时HYPO让我做三维BFS来着,一直没做,看到PO

			
				POJ Finding Nemo 2049 (bfs)
POJ Finding Nemo 2049 (bfs) 2016-08-01
Finding Nemo Time Limit: 2000MS   Memory Limit: 30000K Total Submissions: 9049   Accepted: 2119 Description Nemo is a naughty boy. One day he went into the deep sea all by himself. U

			
				【POJ】 2049 Finding Nemo BFS
【POJ】 2049 Finding Nemo BFS 2014-07-03
题目大意:给你一个奇奇怪怪的迷宫, 这个迷宫包括墙和门。再给你一个起始坐标, 问你从迷宫内到外面至少要穿越多少的门。 题目分析: 穿越

			
				POJ 2049 Finding Nemo ( BFS)
POJ 2049 Finding Nemo ( BFS) 2015-08-05
Finding Nemo Time Limit: 2000MS   Memory Limit: 30000K Total Submissions: 8273   Accepted: 1924 Description Nemo is a naughty boy. One day he went into the deep sea all by himself. Unfo

			
				Finding Nemo(POJ--2049
Finding Nemo(POJ--2049 2015-07-31
Description Nemo is a naughty boy. One day he went into the deep sea all by himself. Unfortunately, he became lost and couldn"t find his way home. Therefore, he sent a signal to his father, Marl
01
2014-04
POJ 2049 Finding Nemo 2014-04-01
这题剧情就是粑粑出发去找他那淘气的儿子。 建模比较麻烦,把每个点的坐标扩大两倍然后把墙坐标点和房间都转化成相应的点来处理,然后存到二

			
				poj 2049 Finding Nemo
poj 2049 Finding Nemo 2015-07-28
                                                                                         Finding Nemo Tim
14
2015-06
【POJ 2049】Finding Nemo 2015-06-14
【POJ 2049】Finding Nemo 迷宫类Bfs,不同于之前的是之前是点 这次是房间,我的做法是把每个房间看做一个点(移动地图使房间为整型坐标 便于用数组下表表示房

			
				POJ  2049 Finding Nemo
POJ 2049 Finding Nemo 2013-08-06
这道题各种忧伤啊,一开始做的时候想用三维数组来标记图中的元素的,但是实现起来很麻烦又放弃了啊、后来用了二维数组存,将边用点来表示
24
2016-11
php 去掉二维数组中的空数组 2016-11-24
一、自己写的,将非空数据整合到一个新数组 $new = array(); foreach($cs_list as $k=>$v){ if ($v["open"] != 0.00) { $new[$k] = $v; } }