1 #include<iostream> 2 #include<stack> 3 #include<string> 4 #include<string> 5 #include<queue> 6 #define in 1 7 #define out 0 8 using namespace std; 9 int main()10 {   queue<bool> road;11     stack<char> ans;12     string begin,end;13     int num,i,j;14     while(cin>>num>>begin>>end)15     {16               17                   while(!ans.empty())18                   ans.pop();19                  i=0;20                  j=0;21    /*              cout<<num<<endl;22                  cout<<begin<<endl;23                  cout<<end<<endl; */24                  for(i=0;i<num;i++)25                  {26                      if(j>=num)27                      break;              28                      ans.push(begin[i]);29                      road.push(in);30                      while(!ans.empty()&&ans.top()==end[j])// 最开始的时候没考虑ans是空的情况看看测试交了 结果数组越界  31                      {32                      ans.pop();33                      road.push(out);34                      j++;35                      if(j>=num)36                      {break;}37                      }       38                  }39                  if(ans.empty())40                  {41                  cout<<"Yes."<<endl;42                   while(!road.empty())43                   {                 if(road.front()==1)44                                    cout<<"in"<<endl;45                                    else46                                    cout<<"out"<<endl;47                                    road.pop();48                   }49                   cout<<"FINISH"<<endl;50                  }51                  else52                  {53                      cout<<"No."<<endl;54                      cout<<"FINISH"<<endl;//这最悲剧了 没仔细看题 no的后面没输出finish WA了 55                      while(!road.empty())//清空路径 56                      road.pop();57                      while(!ans.empty())58                      ans.pop();59                  }                        60     }61   //  system("pause");62     return 0;63 }