HDU 3183 A Magic Lamp 贪心 / RMQ

题目描述

题目链接←戳我
给出一个n位的数字，删去其中的m位数字，使得剩下的数字最小，输出这个最小的数字 （n>=m)

题目分析

法一：

要使删除m位后的数字最小，其实大概就是在求一个最小上升数列，但不一定是，因为只能删除m位数字例如：154321 删除3位数字，剩余数字最小的显然是121，不是一个上升序列
具体过程是
           5 > 4，del 4
           1 < 4，continue
           4 > 3，del 4
           1 < 3，continue
           3 > 2，del 3
剩下的便是121
注意删除一位后，非首位数字都要回退一位再开始判断

法二:

删除m位数字相当于选择n-m位数字，第一个选择的数字在原数列中一定在区间[1，m+1]中，且是该区间中最小的数字（若有多个最小的，取靠前的），以此类推，设a为原数组，设index[i]表示最小的 n - m 位数字的第 i 位数字在原数列中的下标（应该看得懂吧），注：index[0]=0
则 index[i]∈[index[i-1]+1，index[i-1]+1+(m-i+1)+1]
而且a[index[i]]=min{a[k]}，k∈[index[i-1]+1，index[i-1]+1+(m-i+1)+1]
这就变成了典型的RMQ问题了，可以用ST表Θ(log(n))预处理区间最小值，再Θ(1)查询了

代码参考

法一：

/*
 * @Author: CHAOS_ORDER
 * @Date: 2019-09-17 16:40:30
 * @LastEditors: CHAOS_ORDER
 * @LastEditTime: 2019-09-21 12:49:20
 * @Description: D - A Magic Lamp
 * @Status: Accepted 15ms
 */
#include <functional>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <iomanip>
#include <cstdio>
#include <string>
#include <vector>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <set>
using namespace std;
#define pdn(i) printf("%d\n", i)
#define plldn(i) printf("%lld\n", i)
#define pchstrn(i) printf("%s\n", i)
#define sdd(i, j) scanf("%d%d", &i, &j)
#define slldd(i, j) scanf("%lld%lld", &i, &j)
#define sdt(i, j, k) scanf("%d%d%d", &i, &j, &k)
#define slldt(i, j, k) scanf("%lld%lld%lld", &i, &j, &k)
#define sd(i) scanf("%d", &i)
#define pd(i) printf("%d", i)
#define slld(i) scanf("%lld", &i)
#define plld(i) printf("%lld", i)
#define schstr(i) scanf("%s", i)
#define pchstr(i) printf("%s", i)
#define For(i, begin, end) for (register int i = begin; i <= end; i = i + 1)
#define rFor(i, begin, end) for (register int i = begin; i >= end; i = i - 1)
#define newline printf("\n")
#define pause system("pause")
#define mod 1000000007
#define inf 0x3f3f3f3f
typedef long long ll;
typedef unsigned long long ull;
const ll maxn = 1e7 + 8;
const ll maxm = 1e7 + 8;

char a[1024];
int L[1024];
int R[1024];

int main()
{
    int m;
    while (scanf("%s%d", a + 1, &m) != EOF)
    {
        int len = strlen(a + 1);
        For(i, 0, len)
            L[i] = i - 1,
            R[i] = i + 1;
        // cout << len << endl;
        a[0] = '0';
        for (int i = 1; m && i <= len - 1;)
        {
            if (a[i] > a[R[i]])
            {
                m--;
                R[L[i]] = R[i];
                L[R[i]] = L[i];
                i = L[i];
            }
            else
            {
                i = R[i];
            }
        }
        if (m != 0)
        {
            for (int i = len; m && i >= 1;)
            {
                m--;
                R[L[i]] = R[i];
                L[R[i]] = L[i];
                i = L[i];
            }
        }
        bool fa = false;
        for (int i = 0; R[i] <= len;)
        {
            i = R[i];
            if (a[i] != '0')
            {
                fa = true;
                putchar(a[i]);
            }
            else if (a[i] == '0')
            {
                if (fa)
                {
                    putchar(a[i]);
                }
            }
        }
        if (!fa)
            putchar('0');
        newline;
    }
    return 0;
}

法二：

/*
 * @Author: CHAOS_ORDER
 * @Date: 2019-09-21 13:22:30
 * @LastEditors: CHAOS_ORDER
 * @LastEditTime: 2019-09-21 15:07:52
 * @Description: D - A Magic Lamp
 * @Status: Accepted 0ms
 */
#include <functional>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <iomanip>
#include <cstdio>
#include <string>
#include <vector>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <set>
using namespace std;
#define pdn(i) printf("%d\n", i)
#define plldn(i) printf("%lld\n", i)
#define pchstrn(i) printf("%s\n", i)
#define sdd(i, j) scanf("%d%d", &i, &j)
#define slldd(i, j) scanf("%lld%lld", &i, &j)
#define sdt(i, j, k) scanf("%d%d%d", &i, &j, &k)
#define slldt(i, j, k) scanf("%lld%lld%lld", &i, &j, &k)
#define sd(i) scanf("%d", &i)
#define pd(i) printf("%d", i)
#define slld(i) scanf("%lld", &i)
#define plld(i) printf("%lld", i)
#define schstr(i) scanf("%s", i)
#define pchstr(i) printf("%s", i)
#define For(i, begin, end) for (register int i = begin; i <= end; i = i + 1)
#define rFor(i, begin, end) for (register int i = begin; i >= end; i = i - 1)
#define newline printf("\n")
#define pause system("pause")
#define mod 1000000007
#define inf 0x3f3f3f3f
typedef long long ll;
typedef unsigned long long ull;
const ll maxn = 1e7 + 8;
const ll maxm = 1e7 + 8;

char s[1024];
char ans[1024];
int st[1024][10];

int _min(int i, int j)
{
    return s[i] <= s[j] ? i : j;
}

void st_pretreat(int n)
{
    For(i, 1, n)
        st[i][0] = i;
    for (int j = 1; (1 << j) <= n; j++)
    {
        for (int i = 1; i + (1 << j) - 1 <= n; i++)
        {
            st[i][j] = _min(st[i][j - 1], st[i + (1 << (j - 1))][j - 1]);
        } //st[i][j] is the index of min number in range[i,i+(i<<j)]
    }
}

int query(int l, int r)
{
    int len = log2(r - l + 1);
    return _min(st[l][len], st[r - (1 << len) + 1][len]);
} // return the index of min number in range[l,r]

int main()
{
    int m;
    while (scanf("%s%d", s + 1, &m) != EOF)
    {
        int len = strlen(s + 1);
        st_pretreat(len);
        int pos = 1;
        int cnt = 0;
        while (m < len)
        {
            m++;
            pos = query(pos, m);
            // cout << pos << endl;
            ans[cnt++] = s[pos++];
        }
        bool fa = false;
        For(i, 0, cnt - 1)
        {
            if (ans[i] != '0')
            {
                fa = true;
                putchar(ans[i]);
            }
            else if (fa)
                putchar(ans[i]);
        }
        if (!fa)
            putchar('0');
        newline;
    }
    return 0;
}