E. A Magic Lamp
E. A Magic LampTime Limit: 1000ms
Case Time Limit: 1000ms
Memory Limit: 32768KB
64-bit integer IO format: %I64d Java class name: Main
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做的，不明白啊！
1 #include <iostream>
2 #include <cstdio>
3 #include <cstring>
4 #include <cstdlib>
5 #include <vector>
6 #include <climits>
7 #include <algorithm>
8 #include <cmath>
9 #define LL long long
10 using namespace std;
11 char str;
12 int main(){
13 int m,len,i,top;
14 while(scanf("%s %d",str,&m) == 2){
15 len = strlen(str);
16 top = 0;
17 for(i = 1; i < len;){
18 if(m && top >= 0 && str > str){m--;top--;}
19 else if(top != -1 || str != '0') str[++top] = str;
20 else i++;
21 }
22 while(top >= 0 && m){top--;m--;}
23 if(top == -1) str[++top] = '0';
24 str[++top] = '\0';
25 printf("%s\n",str);
26 }
27 return 0;
28 }
View Code
页:
[1]