HDU1022+栈

栈的应用

/*
栈
*/
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<algorithm>
#include<iostream>
#include<queue>
#include<stack>
//#include<map>
#include<math.h>
using namespace std;
typedef long long ll;
//typedef __int64 int64;
const int maxn = 1005;
const int inf = 0x7fffffff;
const double pi=acos(-1.0);
const double eps = 1e-8;
char in[ maxn ],out[ maxn ];
stack<int>mys;
int ans[ maxn ];
int main(){
    int n;
    while( scanf("%d",&n)!=EOF ){
        scanf("%s%s",in,out);
        if( n==1 ){
            if( in[0]==out[0] ){
                printf("Yes.\n");
                printf("in\nout\n");
                printf("FINISH\n");
                continue;
            }
            printf("No.\n");
            printf("FINISH\n");
            continue;
        }
        while( !mys.empty() ) mys.pop();//mys.clear();
        int cnt=0;
        int pos=0;
        int ans_pos=0;
        for( int i=0;i<n;i++ ){
            if( mys.empty() ){
                mys.push( in[ i ]-'0' );
                ans[ ans_pos++ ]=1;
            }//火车进站
            else if( mys.top()==(out[ pos ]-'0') ){
                while( !mys.empty()&&mys.top()==(out[ pos ]-'0') ){
                    mys.pop();
                    pos++;
                    cnt++;
                    ans[ ans_pos++ ]=-1;
                }
                i--;
            }//火车出站
            else {
                mys.push( in[i]-'0' );
                ans[ ans_pos++ ]=1;
            }
        }//火车进站，这时候没火车出去
        while( !mys.empty()&&mys.top()==(out[ pos ]-'0') ){
            mys.pop();
            pos++;
            cnt++;
            ans[ ans_pos++ ]=-1;
        }
        if( cnt==n ){
            printf("Yes.\n");
            for( int i=0;i<ans_pos;i++ )
                if( ans[i]==1 )
                    printf("in\n");
                else
                    printf("out\n");
        }
        else
            printf("No.\n");
        printf("FINISH\n");
    }
    return 0;
}