简单的栈操作的模拟，入栈出栈

Train Problem I

3 123 321
3 123 312

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

HintHint
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.".
代码如下，sta数组用来存放没有匹配成功的，flag数组标记出入栈的信息，具体的操作需要大家花时间自己动手看一下具体的实现过程#include<stdio.h>
#include<string.h>
char in[100],out[100];
int flag[200];
int sta[200];
int main()
{
int n;
int top;
int i,j,k;
int ok;
while(scanf("%d",&n)!=EOF)
{

scanf("%s%s",&in,&out);
top=0;
i=j=k=0;
ok=1;
while(j<n)
{
if(in[i]==out[j])
{
flag[k++]=0;
flag[k++]=1;
i++;
j++;
}
else if(top>0 && sta[top-1]==out[j])
{
flag[k++]=1;
top--;
j++;
}
else if(i<n)
{
sta[top++]=in[i++];
flag[k++]=0;

}
else
{
ok=0;
break;
}
}
if(ok==0) printf("No.\n");
else
{
printf("Yes.\n");
for(int p=0;p<k;p++)
{
if(flag[p]==0)
printf("in\n");
else printf("out\n");
}
}
printf("FINISH\n");
}
return 0;
}