Train Problem I（栈和队列）

      
      

       
       3 123 321
3 123 312
      
      

      
      

       
       Yes.
in
in
in
out
out
out
FINISH
No.
FINISH


       
       

        
        

         
         Hint
        
        
Hint
       
       
       
        
For the first Sample Input, we let train 1 get in, then train 2 and train 3.
So now train 3 is at the top of the railway, so train 3 can leave first, then train 2 and train 1.
In the second Sample input, we should let train 3 leave first, so we have to let train 1 get in, then train 2 and train 3.
Now we can let train 3 leave.
But after that we can't let train 1 leave before train 2, because train 2 is at the top of the railway at the moment.
So we output "No.".
      
      

#include<stdio.h>
#include<stack>
#include<string.h>
#include<queue>
#include<string>
#include<iostream>
using namespace std;
 
int main(){
		
	int n;
	
	while(scanf("%d",&n)!=EOF){
		
		stack<char>st;
	    queue<string>st2;
		
		char str[1000];
		char str1[1000];
		
		scanf("%s%s",str,str1);
		
		int j=0;
		for(int i=0;i<n;i++)
		{
			st.push(str[i]);
			st2.push("in");
			while(!st.empty()&&st.top()==str1[j])
			{
				st.pop();
				st2.push("out");
				j++;
			}
			
		}
		if(j==n)
		{
			printf("Yes.\n");
			while(!st2.empty()){
				cout<<st2.front()<<endl;
				st2.pop();
			}
		}
		
	else
	printf("No.\n");	
	printf("FINISH\n");
			
	}
	
	
}