★HDU 4336 Card Collector 详细题解（状压求期望）

最新推荐文章于 2021-03-05 16:45:08 发布

键盘里的青春

最新推荐文章于 2021-03-05 16:45:08 发布

阅读量898

点赞数 2

分类专栏：概率DP 状压DP ACM 文章标签：概率dp 状压期望好题

本文链接：https://blog.csdn.net/qq_34374664/article/details/65936398

版权

博客详细介绍了如何利用状态压缩和动态规划方法解决HDU 4336 Card Collector问题，探讨了在求期望过程中正确理解和应用概率的重要性，特别强调了在计算转移事件概率时要除以能发生转移的概率和的关键点。

摘要由CSDN通过智能技术生成

Card Collector

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4309 Accepted Submission(s): 2172
Special Judge

Problem Description

In your childhood, do you crazy for collecting the beautiful cards in the snacks? They said that, for example, if you collect all the 108 people in the famous novel Water Margin, you will win an amazing award.

As a smart boy, you notice that to win the award, you must buy much more snacks than it seems to be. To convince your friends not to waste money any more, you should find the expected number of snacks one should buy to collect a full suit of cards.