whac mole game

Poj3034 -- Whac-a-Mole (dp) The n * n Square, the hammer moves d at most each time, and the hamster appears at (x, y) time at the t time to maintain a unit of time, two rats won't appear at the same time. The hammer can hit the mouse and ask how many rats can be smashed at most. (The initial hammer can be anywhere) Dp [t] [I] [j]: the maximum number of hamster that a hammer can hit at the position (I, j) a

In an N * n matrix, each (x, y) Coordinate has a hole at any time point (from the previous time point to the current time point ), A mole's head may be located at any position. If a point is hit by a hammer, the range of the hammer activity is D (1 = The appearance of moles in this case can obtain the maximum number of points. Question: dynamic planning. The optimal result is obtained from the optimal result of the subproblem. Note: The Hammer can be moved out of the matrix.How many points can b