HDU3183A Magic Lamp,和NYOJ最大的数一样
来源:互联网 发布:linux 用户组权限 编辑:程序博客网 时间:2024/05/21 22:34
A Magic Lamp
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2937 Accepted Submission(s): 1145
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?
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
我的天,这个题只要细心基本上没什么大问题,哎,,,,做的好辛苦啊,,思路也和NYOJ上贪心专题里的最大的数一样,,,可是把代码复制过来改改交却WA了一遍又一遍,,改的好辛苦,依旧错。。。
看起来都没多大区别:
#include<bits/stdc++.h>using namespace std;const int N=1001;char a[N],b[N];int main(){ int n,i,j,k1,k2,k3,x1,x2; while(~scanf("%s%d",a,&n)) { memset(b,'0',sizeof(b)); x1=strlen(a); if(x1==n) { printf("0\n"); continue; } else { j=k1=k3=0,k2=n,x2=x1-n; char c; while(x2--) { c=a[k1],k3=k1; for(i=k1; i<=k2; i++) { if(k1==k2) { k3=k2; break; } if(a[i]<c) c=a[i],k3=i; } b[j++]=c,k1=k3+1,k2++; } for(i=0; i<j; i++) if((b[i]!='0')||(i==j-1)) { x2=i; break; } for(i=x2; i<j; i++) printf("%c",b[i]); printf("\n"); } } return 0;}
怎么说嘞,只能说做题沉心静气,细心~~
0 0
- HDU3183A Magic Lamp,和NYOJ最大的数一样
- hdu3183A Magic Lamp【RMQ】
- hdu3183A Magic Lamp 贪心问题
- NYOJ-最大的数
- 最大的数 nyoj 1170
- NYOJ 1170 最大的数
- NYOJ-1170 最大的数
- 最大的数(nyoj 1170)
- NYOJ 1170 最大的数(待续)
- nyoj 1170 最大的数(贪心)
- NYOJ题目1170-最大的数
- NYOJ 1170 最大的数 贪心
- NYOJ 寻找最大数
- NYOJ 寻找最大数
- NYOJ-寻找最大数
- NYOJ-寻找最大数
- nyoj 寻找最大数
- nyoj 寻找最大数
- 汤姆大叔的博客 JS/jQuery
- Android-Universal-Image-Loader 图片异步加载类库的使用
- JAVA实现最短距离算法之迪杰斯特拉算法
- poj --1011
- mac下sublime text3中文乱码问题
- HDU3183A Magic Lamp,和NYOJ最大的数一样
- Linux下的常用终端调试指令(2)
- 浅析HTML5的10大优势
- 基于Jmeter的MQTT测试插件-上
- 感觉自己最近越来越懒了..
- CLS----公共语言规范
- JAVA算法---最大公约数和最小公倍数
- 连号区间数
- 【NOIP2012提高组】开车旅行