poj3897

【搜索】[POJ3897]Maze Stretching

题目分析：显然是搜索，bfs比较慢，那就用A*吧，但是并不能直接用A*求最短路，因为在你讲迷宫拉伸了之后，你一开始找的最短路并不一定最短（我是这么觉得，自己想想），所以就二分拉伸的比例，然后用A*进行Check。代码#include #include #include #include usingnamespacestd; #defineMAXN100 structnode{ intx,y; do
outer_form·2015-08-26 20:00

[POJ3897] Maze Stretching (二分)(A*)

DescriptionUsuallythepathinamazeiscalculatedasthesumofstepstakenfromthestartingpointuntiltheendingpoint,assumingthatthedistanceofonestepisexactly1.Letsassumethatwecould“stretch”(shortenorextend)themaz
u011542204·2015-07-23 21:00

poj3897 Maze Stretching

MazeStretchingTimeLimit:1000MS MemoryLimit:65536KTotalSubmissions:751 Accepted:198DescriptionUsuallythepathinamazeiscalculatedasthesumofstepstakenfromthestartingpointuntiltheendingpoint,assumingthatth
u010422038·2013-07-18 20:00
上一页 1 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他