Train Problem I

http://acm.hdu.edu.cn/showproblem.php?pid=1022

#include<iostream>
#include<stack>
#include<cstring>
using namespace std ;
int main()
{
    int n, i, j, k, d[18] ;
    string a, b ;
    while(cin>>n>>a>>b)
    {
        i = j = k = 0 ;
        stack<int>s ;
        int flag = 1 ;
        while(j<n)
        {
            if(a[i]==b[j])
            {
                i++ ;
                j++ ;
                d[k++] = 1 ;
                d[k++] = 0 ;
            }
            else if(!s.empty()&&s.top()==b[j])
            {
                d[k++] = 0 ;
                s.pop() ;
                j++ ;
            }
            else if(i<n)
            {
                d[k++] = 1 ;
                s.push(a[i]) ;
                i++ ;
            }
            else
            {
                flag = 0 ;
                break ;
            }
        }
        if(flag)
        {
            cout<<"Yes."<<endl ;
            for(i=0; i<k; i++)
            if(d[i])
            cout<<"in"<<endl ;
            else
            cout<<"out"<<endl ;
        }
        else
        cout<<"No."<<endl ;
        cout<<"FINISH"<<endl ;
    }
    return 0 ;
}

用G++提交