【HDU4576】Robot

最新推荐文章于 2021-09-26 12:58:58 发布

原创

最新推荐文章于 2021-09-26 12:58:58 发布 · 500 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#递推与dp

本文探讨了HDU4576题目中关于机器人的路径规划问题，通过递推与动态规划的方法，详细解析了解题思路和实现过程，帮助读者理解如何在受限环境中寻找最优解。

Michael has a telecontrol robot. One day he put the robot on a loop with n cells. The cells are numbered from 1 to n clockwise.

At first the robot is in cell 1. Then Michael uses a remote control to send m commands to the robot. A command will make the robot walk some distance. Unfortunately the direction part on the remote control is broken, so for every command the robot will chose a direction(clockwise or anticlockwise) randomly with equal possibility, and then walk w cells forward.
Michael wants to know the possibility of the robot stopping in the cell that cell number >= l and <= r after m commands.
Input

There are multipl