hihocoder#1103 栈

#include<iostream>  
#include<string>  
#include<string.h>
#include<algorithm>  
#include<fstream>
#include<stack>
#include<map>
using namespace std;  
#define lch(i) ((i)<<1)  
#define rch(i) ((i)<<1|1)  
#define sqr(i) ((i)*(i))  
#define pii pair<int,int>  
#define mp make_pair  
#define FOR(i,b,e) for(int i=b;i<=e;i++)  
#define FORE(i,b,e) for(int i=b;i>=e;i--)  
#define ms(a)   memset(a,0,sizeof(a))  
const int maxnum =100003;
const  int  INF = 10000;

stack<string> color;
map<string,int> num;

int main()    
{  
#ifdef _DEBUG_
    fstream fin("G:/1.txt");
#else
#define fin cin
#endif
    char text[1000];
    num["red"]=0;
    num["yellow"]=0;
    num["blue"]=0;
    gets(text);
    int size = strlen(text);
    FOR(i,0,size-1){
        if(text[i]==' ')continue;
        if(text[i]=='<'){
            if(text[i+1]=='/'){
                i++;
                color.pop();
                if(text[i+1]=='r')
                    i+=4;
                else if(text[i+1]=='b')
                    i+=5;
                else
                    i+=7;
                continue;
            }
            if(text[i+1]=='r'){
                color.push("red");
                i+=4;
            }else if(text[i+1]=='b'){
                color.push("blue");
                i+=5;
            }else{
                color.push("yellow");
                i+=7;
            }
            continue;
        }
        if(!color.empty())
            num[color.top()]++;
    }
    cout<<num["red"]<<' '<<num["yellow"]<<' '<<num["blue"]<<endl;



    return 0;  
}