C++RMQ算法—————A Magic Lamp

最新推荐文章于 2025-01-12 00:15:00 发布

C2020lax

最新推荐文章于 2025-01-12 00:15:00 发布

阅读量462

点赞数 3

分类专栏： RMQ 文章标签： C++ RMQ

本文链接：https://blog.youkuaiyun.com/weixin_43810158/article/details/90637949

版权

本文介绍了一道关于使用C++解决旅行者Kiki遇到的问题，她需要找到一种方法，从一个长整数中删除m个数字，使得剩余数字组成的整数最小。该问题可以转化为求数列中删去m个元素后的最小值，通过RMQ算法来求解。文章详细讲解了思路，并提供了代码实现。

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

题目描述：

Kiki likes traveling. One day she finds a magic lamp, unfortunately the genie in the lamp is not so kind. Kiki must answer a question, and then the genie will realize one of her dreams.
The question is: give you an integer, you are allowed to delete exactly m digits. The left digits will form a new integer. You should make it minimum.
You are not allowed to change the order of the digits. Now can you help Kiki to realize her dream?

输入：

There are several test cases.
Each test case will contain an integer you are given (which may at most contains 1000 digits.) and the integer m (if the integer contains n digits, m will not bigger then n). The given integer will not contain leading zero.