[hdu4041]Eliminate Witches!

模拟树的遍历过程 特殊情况需要留意比如‘,’在‘)’后面 还有‘)’紧接着‘)’的情况

#include<iostream>
#include<cstdio>
#include<stack>
#include<queue>
#include<cstring>
using namespace std;
char name[50010][20],str[1000010];
stack<int> fa;
queue<int> qu;
int main()
{
    int T;
    scanf("%d",&T);
    while (T--)
    {
        scanf("%s",str);
        int len=strlen(str);
        while (!fa.empty()) fa.pop();
        while (!qu.empty()) qu.pop();
        int num=0;
        for (int i=0;i<len;i++)
        {
            int j=0;
            while (islower(str[i])&&i<len)
            {
                if (j==0) num++;
                name[num][j++]=str[i++];
            }
            if (j!=0) name[num][j]='\0';
            if (str[i]=='(')
            {
                qu.push(num);
                fa.push(num);
            }
            else if (str[i]==')')
            {
                if (str[i-1]!=')') qu.push(num);
                qu.push(fa.top());
                fa.pop();
            }
            else if (str[i]==',')
            {
                if (str[i-1]!=')') qu.push(num);
                qu.push(fa.top());
            }
        }
        printf("%d\n",num);
        for (int i=1;i<=num;i++)
        printf("%s\n",name[i]);
        while (qu.size()>1)
        {
            printf("%d ",qu.front());
            qu.pop();
            printf("%d\n",qu.front());
        }
        printf("\n");
    }
    return 0;
}