[hdu 3183]A Magic Lamp [RMQ or Greedy]

最新推荐文章于 2020-04-19 22:19:53 发布

真·skysys

最新推荐文章于 2020-04-19 22:19:53 发布

阅读量767

点赞数 1

分类专栏：算法与数学文章标签： RMQ 贪心

请明确标注出处

本文链接：https://blog.youkuaiyun.com/qq_33583069/article/details/51980028

版权

算法与数学专栏收录该内容

469 篇文章 ¥29.90 ¥99.00

订阅专栏

超级会员免费看

该博客介绍了一个问题，Kiki需要找到一个方法，从给定的数字中删除m个数字，以形成最小的新数字。提供了两种解决方案：使用RMQ（Range Minimum Query）算法和贪心策略。题目要求保持数字顺序不变，且最终结果不包含前导零。

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

A Magic Lamp
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Problem Description
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?

Input
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 wil

了解本专栏