文件名称:xunbao
- 所属分类:
- Windows编程
- 资源属性:
- [Windows] [Visual C] [源码]
- 上传时间:
- 2012-11-26
- 文件大小:
- 931kb
- 下载次数:
- 0次
- 提 供 者:
- kine*****
- 相关连接:
- 无
- 下载说明:
- 别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容均来自于网络,请自行研究使用
对于某个m*n的字符串数组,相当于一个m行n列的平面形状的方格。里面S表示起点,W表示障碍,B表示可走(但是不一定可以通),X表示出口。对于起点S,有8个方向可以走,当然前提是在没有障碍的情况之下,其中可以分为单步走(on foot)和跳步走(by jump)两种情况,从起点S开始追寻最短的出口路径count2。-M* n to a string array, which is equivalent to an m line n of the plane out of the box shape. Express the starting point of S inside, W express obstacles, B indicated that they could walk (but not necessarily pass), X express export. For the starting point of S, has 8 direction can go, of course, the premise that there are no obstacles in the circumstances, which can be divided into single-step walk (on foot) and the jump step-by-step walk (by jump) both cases, the starting point S from the beginning to trace the the shortest path export count2.
相关搜索: 字符串数组
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Debug
.....\vc60.idb
.....\vc60.pdb
.....\寻宝.exe
.....\寻宝.ilk
.....\寻宝.obj
.....\寻宝.pch
.....\寻宝.pdb
寻宝.cpp
寻宝.dsp
寻宝.dsw
寻宝.ncb
寻宝.opt
.....\vc60.idb
.....\vc60.pdb
.....\寻宝.exe
.....\寻宝.ilk
.....\寻宝.obj
.....\寻宝.pch
.....\寻宝.pdb
寻宝.cpp
寻宝.dsp
寻宝.dsw
寻宝.ncb
寻宝.opt