HDU-3183-A Magic Lamp

最新推荐文章于 2020-05-20 17:14:26 发布

原创最新推荐文章于 2020-05-20 17:14:26 发布 · 496 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#贪心算法

贪心算法专栏收录该内容

42 篇文章

订阅专栏

本文介绍了一个经典的贪心算法题目——HDU3183魔法灯问题。题目要求从给定的一串数字中删除指定数量的数字后形成最小可能的整数。文章详细解析了解题思路并提供了完整的C++实现代码。

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

E - A Magic Lamp HDU 3183
Time Limit: 1000 MS Memory Limit: 32768 KB

64-bit integer IO format: %I64d , %I64u Java class name: Main

[Submit] [Status]

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 will not bigger then n). The given integer will not contain leading zero.
Output
For each case, output the minimum result you can get in one line.
If the result contains leading zero, ignore it.
Sample Input
178543 4
1000001 1
100001 2
12345 2
54321 2
Sample Output
13
1
0
123
321

题意：给出一串数字，给出m，不改变原数字顺序的前提下，删掉m个数字，输出各种删除方法中，剩余数字最小的那一串剩余数字

贪心水题

#include<stdio.h>
#include<string.h>
#include<string>
#include<stack>
#include<queue>
#include<math.h>
#include<limits.h>
#include<iostream>
#include<algorithm>
using namespace std;
//贪心算法
char str[1010];
int a[1010];
int c[1010];
int main()
{
    int k,m,i,tt,len,j;
    while(~scanf("%s %d",str,&m))
    {
        len=strlen(str);
        for(i=0; i<len; i++)
            a[i]=str[i]-'0';//转化为int
        k=0;
        for(i=0; i<len-1&&m>0; i++)
        {
            if(a[i]<=a[i+1])//小的数存到c数组
            {
                c[k++]=a[i];
            }
            else
            {
                m--;
                while(c[k-1]>a[i+1]&&m>0)
                {
                    k--;//后退，覆盖之前的数
                    m--;//剩余删除数量
                }
            }
        }
        for(; i<len; i++)
            c[k++]=a[i];
        for(i=0; i<k-m; i++)
        {
            if(c[i]!=0)//除去前导零
                break;
        }
        if(i==k-m)//如果后面没数了
            printf("0");//输出零
        else
        {
            for(j=i; j<k-m; j++)
                printf("%d",c[j]);
        }
        printf("\n");
    }
    return 0;
}