hdu 3183 A Magic Lamp rmq或者暴力

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

 

Source

HDU 2009-11 Programming Contest

题意：给你一个数，在1000位内（字符串），删掉m个数，得到最小的数输出；

rmq ：思路：第一位在len-m内；找到第n位以后，最后留下没有找数的数目（len-m-n），在n之后的区间找n+1；（0ms）

#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<queue>
#include<algorithm>
#include<stack>
#include<cstring>
#include<vector>
#include<list>
#include<set>
#include<map>
using namespace std;
#define ll long long
#define mod 1000000007
#define inf 999999999
int scan()
{
    int res =  , ch ;
    while( !( ( ch = getchar() ) >= '' && ch <= '' ) )
    {
        if( ch == EOF )  return  <<  ;
    }
    res = ch - '' ;
    while( ( ch = getchar() ) >= '' && ch <= '' )
        res = res *  + ( ch - '' ) ;
    return res ;
}
char a[];
int dp[][];//存位置
char ans[];
int minn(int x,int y)
{
    return a[x]<=a[y]?x:y;
}
void rmq(int len)
{
    for(int i=; i<len; i++)
    dp[i][]=i;
    for(int j=; (<<j)<len; j++)
    for(int i=; i+(<<j)-<len; i++)
    dp[i][j]=minn(dp[i][j-],dp[i+(<<(j-))][j-]);
}
int query(int l,int r)
{
    int x=(int)(log((double)(r-l+))/log(2.0));
    return minn(dp[l][x],dp[r-(<<x)+][x]);
}
int main()
{
    int x,y,z,i,t;
    while(~scanf("%s%d",a,&x))
    {
        int len=strlen(a);
        rmq(len);
        int st=,en=x;
        int flag=;
        for(i=; i<len-x; i++)
        {
            int number=query(st,en);
            //cout<<st<<" "<<en<<" "<<number<<endl;
            st=number+;
            en=i+x+;
            ans[flag++]=a[number];
        }
        for(i=; i<flag; i++)
            if(ans[i]!='')
                break;
        for(t=i; t<flag; t++)
            printf("%c",ans[t]);
        if(i==flag)
            printf("");
        printf("\n");
    }
}

暴力思路：在字符串中查找a[i]>a[i+1];找到第一个删掉；如果没有，说明是一直上升；最后的数最大，删掉最后一个；

#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<queue>
#include<algorithm>
#include<stack>
#include<cstring>
#include<vector>
#include<list>
#include<set>
#include<map>
using namespace std;
#define ll long long
#define mod 1000000007
#define inf 999999999
int scan()
{
    int res =  , ch ;
    while( !( ( ch = getchar() ) >= '' && ch <= '' ) )
    {
        if( ch == EOF ) return  <<  ;
    }
    res = ch - '' ;
    while( ( ch = getchar() ) >= '' && ch <= '' )
        res = res *  + ( ch - '' ) ;
    return res ;
}
vector<int>v;
char a[];
int main()
{
    int x,y,z,i,t;
    while(~scanf("%s%d",a,&x))
    {
        v.clear();
        int len=strlen(a);
        for(i=; i<len; i++)
            v.push_back(a[i]-'');
        while(x--)
        {
            int flag=;
            int len=v.size();
            for(i=; i<len-; i++)
            {
                if(v[i]>v[i+])
                {
                    flag=;
                    v.erase(v.begin()+i);
                    break;
                }
            }
            if(flag)
                v.erase(v.begin()+len-);
        }
        for(i=; i<v.size(); i++)
            if(v[i])
                break;
        for(t=i; t<v.size(); t++)
            printf("%d",v[t]);
        if(i==v.size())
            printf("");
        printf("\n");
    }
    return ;
}