UVA 11491 Erasing and Winning

Test instructions

Give you an n-bit integer, let you delete the D number, the remaining number should be as large as possible.

Analysis:

Vector array simulation was used. If the number of the last digit in the >vector array that is currently being inserted is replaced and d--

Code:

　　

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
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)
            cout<<s[i];
        printf ("\ n");
    }
    return 0;
}

UVA 11491 Erasing and Winning