首页 > 代码库 > E. A Magic Lamp
E. A Magic Lamp
E. A Magic Lamp
1000ms
1000ms
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?
View Code
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.
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.
If the result contains leading zero, ignore it.
Sample Input
178543 4 1000001 1100001 212345 254321 2
Sample Output
1310123321
解题:本来要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 long10 using namespace std;11 char str[1100];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[top] > str[i]){m--;top--;}19 else if(top != -1 || str[i] != ‘0‘) str[++top] = str[i++];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 }
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。