题解报告Robberies（概率dp）

Robberies题解：概率dp求最大抢劫金额

最新推荐文章于 2022-07-20 08:22:28 发布

原创

最新推荐文章于 2022-07-20 08:22:28 发布 · 331 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#概率dp #题解报告

该博客介绍了一个概率动态规划（概率dp）问题，讲述了名为Roy的盗贼计划抢劫一系列银行，每个银行都有一定的金额和被抓捕的概率。目标是在不超过设定的被抓捕概率限制下，最大化预期抢到的金额。博主提供了问题描述、输入输出格式、样例输入输出，以及解题思路，包括使用动态规划的方法来解决这个问题。

Problem Description

The aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually gets caught in the end, often because they become too greedy. He has decided to work in the lucrative business of bank robbery only for a short while, before retiring to a comfortable job at a university.

For a few months now, Roy has been assessing the security of various banks and the amount of cash they hold. He wants to make a calculated risk, and grab as much money as possible.

His mother, Ola, has decided upon a tolerable probability of getting caught. She feels that he is safe enough if the banks he robs together give a probability less than this.