UVa11491 - Erasing and Winning
来源:互联网 发布:知锦教育龙腾 编辑:程序博客网 时间:2024/06/05 12:48
找最大的数嘛
位数优先
然后首位优先
#include<bits/stdc++.h>using namespace std;vector<char>s;int main(){ int n,d; while(~scanf("%d%d",&n,&d)&&n){ int len=n-d; s.clear(),getchar(); for(int i=0;i<n;i++){ char c=getchar(); if(s.size()>0){ int p=(int)s.size()-1; while(d&&c>s[p]&&p>=0){ s.erase(s.begin()+p--); --d; } } if(s.size()!=len) s.push_back(c); else --d; } for(int i=0;i<s.size();++i) putchar(s[i]); printf("\n"); } return 0;}
0 0
- UVa11491 - Erasing and Winning
- UVA11491:Erasing and Winning(奖品的价值)
- 习题8-4 奖品的价值(Erasing and Winning, UVa11491)
- Erasing and Winning UVA
- Erasing and Winning UVA
- uva 11491 Erasing and Winning
- UVA - 11491 Erasing and Winning
- Uva - 11491 - Erasing and Winning
- uva 11491 - Erasing and Winning
- uva 11491/Erasing and Winning
- UVA 11491 Erasing and Winning
- UVA-11491 Erasing and Winning
- UVa 11491 - Erasing and Winning(贪心)
- UVA - 11491 Erasing and Winning 贪心
- 11491 - Erasing and Winning(贪心)
- J - Erasing and Winning UVA 11491
- uva 11491——Erasing and Winning
- Uva 11491 Erasing and Winning(贪心)
- 一、ArrayList概述
- Mysql 列转行统计查询 、行转列统计查询
- [思路贪心]UVa12545 - Bits Equalizer
- win8.1安装apache+php
- 1.将数组A中的内容和数组B中的内容进行交换。(数组一样大)
- UVa11491 - Erasing and Winning
- 获取一个数二进制序列中所有的偶数位和奇数位,分别输出二进制序列。
- POJ1860
- dell 1520 win7 x64 触摸板驱动 synaptics touchpad 16.2.10.3
- 失眠夜
- 1
- 工作的感悟
- securityoverridehacking challenge 解题思路汇总——Steganography
- 2015.9.26 小结