杭电1002http://acm.hdu.edu.cn/showproblem.php?pid=1022
Train Problem I
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 25276 Accepted Submission(s): 9529
Problem Description
As the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because the trains in the Ignatius Train Station is the fastest all over the world ^v^). But here comes a problem, there is only one railway where all the trains stop. So all the trains come in from one side and get out from the other side. For this problem, if train A gets into the railway first, and then train B gets into the railway before train A leaves, train A can't leave until train B leaves. The pictures below figure out the problem. Now the problem for you is, there are at most 9 trains in the station, all the trains has an ID(numbered from 1 to n), the trains get into the railway in an order O1, your task is to determine whether the trains can get out in an order O2.
Input
The input contains several test cases. Each test case consists of an integer, the number of trains, and two strings, the order of the trains come in:O1, and the order of the trains leave:O2. The input is terminated by the end of file. More details in the Sample Input.
Output
The output contains a string "No." if you can't exchange O2 to O1, or you should output a line contains "Yes.", and then output your way in exchanging the order(you should output "in" for a train getting into the railway, and "out" for a train getting out of the railway). Print a line contains "FINISH" after each test case. More details in the Sample Output.
Sample Input
3 123 321
3 123 312
3 123 312
Sample Output
Yes.
in
in
in
out
out
out
FINISH
No.
FINISH
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.".
Author
Ignatius.L
Recommend
这个题要是手写栈的话一定要注意范围各个参数的范围
题意： 火车进站，出站能否按所给顺序出站 标准栈。
代码1：
#include<cstdio>
#include<string>
#include<iostream>
#define N 20
using namespace std;
string sc[N];
string in,out;
char str[N];
int main()
{
int t ,i , j ,c , k ;
while(~scanf("%d",&t))
{
in.clear();out.clear();
cin>>in>>out;
j = ;c = ; k =;
for( i = ; i < t ; i++ )
{
str[c]=in[i];
sc[k++]="in";
while(c!=-&&str[c]==out[j])//这儿有点问题，c=0这儿有歧义，有时候栈为空，有时候不空，最好别这么写
//也就是，str有变化的时候，第一时间修改c的值
//这儿就是用混了，写成了c != 0，事实上，这儿c=0的时候，栈里还有一个元素
{
sc[k++] = "out";
c--;j++;
}
c++;
}
if(j==t) {printf("Yes.\n");
for( i = ;i < k ; i++)
printf("%s\n", sc[i].c_str());} //string是不可以printf的，要用c_str函数，转为字符数组
else printf("No.\n");
printf("FINISH\n");//少了换行
}
//system("PAUSE");
return ;
}
代码2：
#include<stdio.h>
#include<string.h>
#include<stack>
using namespace std;
int main()
{
int n, i, j, k, flag[];
char s1[], s2[];
stack <char> s;
while(~scanf("%d %s%s",&n,s1,s2))
{
while(!s.empty()) s.pop(); //也可以不写这一句，把 stack <char> s; 就可以了
memset(flag,-,sizeof(flag));
j = k = ;
for(i = ; i < n; i++)
{
s.push(s1[i]);
flag[k++] = ;
while(!s.empty() && s.top() == s2[j])
{
flag[k++] = ;
s.pop();
j++;
}
}
if(j == n)
{
printf("Yes.\n");
for(i = ; i < k; i++)
{
if(flag[i])
printf("in\n");
else
printf("out\n");
}
}
else
printf("No.\n");
printf("FINISH\n");
}
return ;
}
代码3：（感谢提供代码的伟大帅气的松哥~）
#include <cstdio>
using namespace std; int main()
{
int n;
char o1[], o2[];
int stack[];
bool ans[];
while(~scanf("%d", &n))
{
scanf("%s %s", o1, o2);
int top = , cur = , c = ;
for(int i = ; i < n; i++)
{
stack[top++] = o1[i]-'';
ans[c++] = ;
while(top > && stack[top-] == o2[cur]-'')
{
top--;
cur++;
ans[c++] = ;
}
}
if(top > ) puts("No.");
else
{
puts("Yes.");
for(int i = ; i < c; i++)
{
if(ans[i] == ) puts("out");
else puts("in");
}
}
puts("FINISH");
}
return ;
}