HDU1022栈入门

理解好题意这题就好做：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cctype>
#include<cstdlib>
#include<stack>
using namespace std;
int main()
{
int n;
char s[15],ss[15];
while(~scanf("%d %s %s",&n,s,ss))
{
stack<char> a;
int i=0,flag=1;
int k=0;
int f=0;
int dis[30];
while(k<n)
{
if(s[i]==ss[k])
{
i++,k++;
dis[f++]=1;
dis[f++]=0;
}
else
if(!a.empty()&&a.top()==ss[k])
{
a.pop();
dis[f++]=0;
k++;
}
else
if(i<n)
{
a.push(s[i]);
dis[f++]=1;
i++;
}
else
{
flag=0;
break;
}
}
if(flag)
{
cout<<"Yes."<<endl;
for(i=0;i<f;i++)
{
if(dis[i]==1)
cout<<"in"<<endl;
else
cout<<"out"<<endl;
}
}
else
cout<<"No."<<endl;
cout<<"FINISH"<<endl;
}
return 0;
}