天使的车站（栈）

#include<cstdio>
#include<iostream>
#include<stack>
using namespace std;
int main()
{
    int n,now=1,i,chu[30],cnt=1,size=0;
    char k;
    stack<int>station;
    cin>>n;
    while(n--)
    {
        cin>>k;
        if(k=='A')
        {
            chu[cnt++]=now++;
        }
        if(k=='B')
        {
            if(size==5) 
            {
                cout<<"No"<<endl;
                return 0;
            }
            size++;
            station.push(now++);
        }
        if(k=='C')
        {
            if(station.empty())
            {
                cout<<"No"<<endl;
                return 0;
            }
            chu[cnt++]=station.top();
            station.pop();
            size--;
        }
    }
    cout<<"Yes"<<endl;
    for(i=1;i<=cnt-1;i++)
    cout<<chu[i]<<endl;
    return 0;
 }