hdu 1022 简单栈应用

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#define maxn 15
using namespace std;
typedef struct
{
char data[maxn];
int top;
}SqStack;
void initStack(SqStack *S)
{
S->top=-1;
}
void push(SqStack *S,char e)
{
S->top++;
S->data[S->top]=e;
}
void pop(SqStack *S)
{
S->top--;
}
bool jdgStack(SqStack *S)
{
if(S->top<=-1)
return true;
return false;
}
int main()
{
int n;
char a[maxn],b[maxn];
SqStack S;
while(cin>>n>>a>>b)
{
initStack(&S);
int flag[maxn];
memset(flag,0,sizeof(flag));
int k,u;
k=u=0;
for(int i=0;i<n;i++)
{
push(&S,a[i]);
flag[k++]=1;
while(!jdgStack(&S)&&S.data[S.top]==b[u])
{
flag[k++]=0;
pop(&S);
u++;
}
}
if(u==n)
{
cout << "Yes.\n";
for(int i=0;i<k;i++)
{
if(flag[i])
cout << "in\n";
else
cout << "out\n";
}
}
else
cout << "No.\n";
cout << "FINISH\n";
}
return 0;
}