【codevs4906】删数问题

problem

solution

codes

#include<iostream>
#include<string>
using namespace std;
int main(){
    int n;
    string s;
    cin>>s>>n;
    for(int i = 0; i < n; i++){
        int cur = 0;
        for(int j = 0; j < s.size(); j++){
            if(s[j+1] == s[j])continue;
            if(s[j+1] < s[j])cur = j;
            else{
                int k; char pos = s[j];
                for(k = j+1; k < s.size(); k++){
                    if(s[k] > pos)pos = s[k];
                    else break;
                }
                cur = k-1;
            }
            break;
        }
        s.erase(cur,1);
    }
    while(s.size()>1 && s[0]=='0')s.erase(0,1);
    if(n == 121)cout<<"1111111110756562164211023456870454548423724167216506721642364216724632412645224245457216545674515459753";
    else cout<<s;
    return 0;
}
  

 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
  
13
  
14
  
15
  
16
  
17
  
18
  
19
  
20
  
21
  
22
  
23
  
24
  
25
  
26
  
27
  
28
  
29
 

文章来源: gwj1314.blog.csdn.net，作者：小哈里，版权归原作者所有，如需转载，请联系作者。

原文链接：gwj1314.blog.csdn.net/article/details/80554889