给出一个不超过n位数的字符串(
n≤1000
),从当中删除m个数字(
m≤n
),使得剩下的数最小。
欲使剩下的数越小,那我们应该删掉大的而且靠前的数;换一个角度看,就是选出n-m个最小的数字,越靠后越好。
选取第一个数可以这么看:在
[1,m+1]
中选一个最小的,有多个最小的就选最靠前的(保证最优解),假设选取的位置为
i
;那么选第二个数就在
#include<cstdio>
#include<cstring>
#include<iostream>
#define MAXN 1010
using namespace std;
struct tr
{
int l,r,mi,p;
}tree[MAXN*4];
int n,m,a[MAXN],pos,num,last,ans[MAXN];
char s[MAXN];
void build_tree(int i,int l,int r)
{
tree[i].l = l;
tree[i].r = r;
if(l == r)
{
tree[i].mi = a[l];
tree[i].p = l;
return;
}
int mid = (l+r)/2;
build_tree(i*2,l,mid);
build_tree(i*2+1,mid+1,r);
if(tree[i*2].mi == tree[i*2+1].mi)
{
tree[i].mi = tree[i*2].mi;
tree[i].p = min(tree[i*2].p,tree[i*2+1].p);//多个相同选取前面的
}
else if(tree[i*2].mi < tree[i*2+1].mi)
{
tree[i].mi = tree[i*2].mi;
tree[i]. p = tree[i*2].p;
}
else
{
tree[i].mi = tree[i*2+1].mi;
tree[i].p = tree[i*2+1].p;
}
}
void query(int i,int l,int r)
{
if(tree[i].l == l&&tree[i].r == r)
{
if(tree[i].mi < num)
{
num = tree[i].mi;
pos = tree[i].p;
}
else if(tree[i].mi == num&&tree[i].p < pos)
{
pos = tree[i].p;
}
return;
}
if(tree[i].r < l||tree[i].l > r) return;
int mid = (tree[i].l+tree[i].r)/2;
if(r <= mid) query(i*2,l,r);
else if(l > mid) query(i*2+1,l,r);
else
{
query(i*2,l,mid);
query(i*2+1,mid+1,r);
}
}
int main()
{
while(scanf("%s",s) != EOF)
{
memset(a,0,sizeof a);
memset(ans,0,sizeof ans);
int cnt = 0;
n = strlen(s);
scanf("%d",&m);
m = n-m;
for(int i = 1; i <= n; i++) a[i] = s[i-1]-'0';
build_tree(1,1,n);
pos = 0;
while(m > 0)
{
num = 123456;
query(1,pos+1,n-m+1);
m--;
ans[++cnt] = num;
}
int start = 1;
for(; start <= cnt; start++)
if(ans[start] != 0) break;
if(start > cnt) printf("0");
else for(int i = start; i <= cnt; i++) printf("%d",ans[i]);
printf("\n");
memset(s,0,sizeof s);
}
}