Tempter of the Bone II 题目链接:HDU - 2128题意:在迷宫中由起点走到终点, 可以用炸弹炸墙;结构体中多加一个mp存每个状态下的地图(原图不能改 );还有就是vis加一个最高值, 就是说每个状态可能走多次, 搜的题解是20, 我试了一下不同的值发现最小要大于12;但没弄能这个值是怎么计算出的; #include <iostream>#include <cst
题目链接: hdoj1010 Problem Description The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the grou