UVA 384 Slurpys 状态机实现

从隔壁大佬学来的思路,或许这样会更清晰一点……仅供参考。

#include 
#include 

using namespace std;

int main()
{
    char str[100000];
    int n;
    enum states {next_slimps,closing_slimps,next_slumps,new_slumps,f_ing,end_slumps,error};
    while(scanf("%d",&n)!=EOF)
    {
        printf("SLURPYS OUTPUT\n");
        while(n--)
        {
            cin>>str;
            int i=0,opened=0,closed=0,finish_slimps=0;
            char c=str[i];
            states state=next_slimps;
            while(c!='\0')
            {
                switch (state)
                {
                case next_slimps:
                {
                    if(c=='A')
                    {
                        state=next_slumps;
                        opened++;
                        break;
                    }
                    else
                    {
                        state=error;
                        break;
                    }
                }
                case closing_slimps:
                {
                    if(opened!=closed)
                    {
                        if(c=='C')
                        {
                            closed++;
                            break;
                        }
                        else
                        {
                            state=error;
                            break;
                        }
                    }
                    else
                    {
                        state=next_slumps;
                        finish_slimps=1;
                        i--;
                        break;
                    }
                }
                case next_slumps:
                {
                    if(c=='D'||c=='E')
                    {
                        state=new_slumps;
                        break;
                    }
                    else if(c=='B')
                    {
                        state=next_slimps;
                        break;
                    }
                    else if(c=='H')
                    {
                        state=closing_slimps;
                        closed++;
                        break;
                    }
                    else
                    {
                        state=error;
                        break;
                    }
                }
                case f_ing:
                {
                    if(c=='F')
                    {
                        break;
                    }
                    else if(c=='D'||c=='E')
                    {
                        state=new_slumps;
                        break;
                    }
                    else if(c=='G')
                    {
                        state=end_slumps;
                        break;
                    }
                    else
                    {
                        state=error;
                        break;
                    }
                }
                case new_slumps:
                {
                    if(c=='F')
                    {
                        state=f_ing;
                        break;
                    }
                    else
                    {
                        state=error;
                        break;
                    }
                }
                case end_slumps:
                {
                    if(!finish_slimps)
                    {
                        closed++;
                        state=closing_slimps;
                        break;
                    }
                    else
                    {
                        state=error;
                        break;
                    }
                }
                }
                c=str[++i];
                if(state==error)
                {
                    goto print;
                }
            }

print:
            if(state==end_slumps)
            {
                printf("YES\n");
            }
            else
            {
                printf("NO\n");
            }
        }
        printf("END OF OUTPUT\n");
    }
    return 0;
}

你可能感兴趣的:(UVA)