hdu 3183 A Magic Lamp(贪心+RMQ)*

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=3183

A Magic Lamp
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 8321 Accepted Submission(s): 3303

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

---

分析：

先RMQ预处理任意区间最小数所在的位置
要使删除n个数后的使结果最小，首先考虑最终结果的第一个数字，由于最开始的时候可以删除n个数字，那么这个数字一定会出现在前n+1个数中（边界也就是将前n个数都删掉）。做法就是：可以在前n+1个数中找出最小的数，那么删掉的数就是这个最小的数的前面几个数，然后更新n，同时现在删的起始位置改为这个最小的数的后一位，按同样的方法进行下去。
有个注意的地方就是，当删除的数$\ge$剩余的数时，直接全删
做这题的时候思路还不是很清晰

代码：

#include <bits/stdc++.h>

using namespace std;
const int N=1e5+5;
#define p pair<int, int>


char str[1100];
int n;
int dp[1100][15];
int pos[1100][15];

void RMQ_init(int len)
{
	for(int i=1;i<=len;i++)
	{
		dp[i][0]=str[i-1]-'0';
		pos[i][0]=i;
	}
	for(int j=1;(1<<j)<=len;j++)
		for(int i=1;i+(1<<j)-1<=len;i++)
		{
			dp[i][j]=min(dp[i][j-1],dp[i+(1<<j-1)][j-1]);
			if(dp[i][j-1]<dp[i+(1<<j-1)][j-1])
				pos[i][j]=pos[i][j-1];
			else if(dp[i][j-1]==dp[i+(1<<j-1)][j-1])
				pos[i][j]=min(pos[i][j-1],pos[i+(1<<j-1)][j-1]);
			else
				pos[i][j]=pos[i+(1<<j-1)][j-1];
		}
}

int search(int l,int r)
{
	int k=log2(r-l+1);
	if(dp[l][k]<dp[r-(1<<k)+1][k])
		return pos[l][k];
	else if(dp[l][k]==dp[r-(1<<k)+1][k])
		return min(pos[l][k],pos[r-(1<<k)+1][k]);
	else
		return pos[r-(1<<k)+1][k];
}

int main()
{
	while(~scanf("%s%d",str,&n))
	{
		string s="";
		int len=strlen(str);
		if(len==n) 
		{
			printf("0\n");
			continue;
		}
		RMQ_init(len);
		int now=0;
		int id;
		int flag=0;
		int d=n;
		while(d>0)
		{
			if(d>=len-now)
			{
				flag=1;
				break;
			}
			if(now+d>=len)
				id=search(now+1,len-1+1)-1;
			else
				id=search(now+1,now+d+1)-1;
			s=s+str[id];
			d=d-(id-now);
			now=id+1;
		}
		for(int i=now;!flag&&i<len;i++)
			s+=str[i];
		// cout<<"?"<<s<<endl;
		int t=0;
		while(t<len-n&&s[t]=='0') t++;
		if(t>=len-n)
			printf("0\n");
		else
		{
			for(int i=t;i<len-n;i++)
				printf("%c",s[i]);
			printf("\n");
		}
	}
	return 0;
}

另一种不同遍历方法的代码：

#include <bits/stdc++.h>

using namespace std;
const int N=1e5+5;
#define p pair<int, int>


char str[1100];
int n;
int dp[1100][15];
int pos[1100][15];

void RMQ_init(int len)
{
	for(int i=1;i<=len;i++)
	{
		dp[i][0]=str[i-1]-'0';
		pos[i][0]=i;
	}
	for(int j=1;(1<<j)<=len;j++)
		for(int i=1;i+(1<<j)-1<=len;i++)
		{
			dp[i][j]=min(dp[i][j-1],dp[i+(1<<j-1)][j-1]);
			if(dp[i][j-1]<dp[i+(1<<j-1)][j-1])
				pos[i][j]=pos[i][j-1];
			else if(dp[i][j-1]==dp[i+(1<<j-1)][j-1])
				pos[i][j]=min(pos[i][j-1],pos[i+(1<<j-1)][j-1]);
			else
				pos[i][j]=pos[i+(1<<j-1)][j-1];
		}
}

int search(int l,int r)
{
	int k=log2(r-l+1);
	if(dp[l][k]<dp[r-(1<<k)+1][k])
		return pos[l][k];
	else if(dp[l][k]==dp[r-(1<<k)+1][k])
		return min(pos[l][k],pos[r-(1<<k)+1][k]);
	else
		return pos[r-(1<<k)+1][k];
}

int main()
{
	while(~scanf("%s%d",str,&n))
	{
		string s="";
		int len=strlen(str);
		int x=len-n;//x表示最终结果的数字个数
		RMQ_init(len);
		int d=n;
		int now=0;
		while(x--)
		{
			int id=search(now+1,now+d+1)-1;
			s+=str[id];
			d=d-(id-now);
			now=id+1;
		}
		int t=0;
		while(t<len-n&&s[t]=='0') t++;
		if(t>=len-n) 
			cout<<0<<endl;
		else
		{
			for(int i=t;i<len-n;i++)
				cout<<s[i];
			cout<<endl;
		}
		
		
		
	}
	return 0;
}