SWERC 2017 D - Candy Chain 字典树优化区间DP

最新推荐文章于 2023-08-24 12:30:21 发布

lifelikes

最新推荐文章于 2023-08-24 12:30:21 发布

阅读量561

点赞数

CC 4.0 BY-SA版权

分类专栏：动态规划字典树

本文链接：https://blog.youkuaiyun.com/lifelikes/article/details/83280034

帮助Margot计算从糖果链中提取部分糖果卖给孩子们所能获得的最大收益，涉及区间DP和字典树优化的问题。描述了输入输出限制及样例，并提供了题解思路。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

D: Candy Chain
A Candy Chain is a sequence of individual candies. Candies come in 26 different flavors identified by
the lowercase letters a to z. Margot has a particularly fancy Candy Chain displayed in her shop.
After school, children will come to her and buy portions of the Candy Chain. Every child has
different preferences. For example there is a child who likes portions with flavors ababi, and is willing
to pay 3 euros for it. Another child likes portions with flavors axsa and is willing to pay 5 euros for it.
Margot can extract portions of the Candy Chain and sell them to the children. When she extracts a
portion, she joins the remaining left and right parts of the Candy Chain, and can then continue serving
additional portions, or decide to stop.
The same sequence of flavors can be sold multiple times to the same child (as long as Margot is
able to extract multiple instances of it from her Candy Chain). Margot never throws away candies