HDU-1022 Train Problem I(栈)
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
Sample Output
Yes.inininoutoutoutFINISH
No.FINISH
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.".
Hint
Hint
Author
Ignatius.L
Recommend
#include<stdio.h>
#include<string.h>
char str1[15],str2[15],str3[15];
int main()
{
int i,j;
int cnt;
int n;
while(scanf("%d%s%s",&n,str1,str2)!=EOF)
{
cnt=1;
int flag[15];
int l=0;
str3[cnt]=str1[0];
i=0; j=0;
flag[0]=1; //表示已有1个入栈
while(i<n&&j<n)
{
if(str3[cnt]==str2[j]) //cnt==0,就说明车都开出去了 cnt一开始要等于1
//0表示出栈,1表示进栈 从左往右0的累积数不能大于1
// 引入一个cnt记录1与0累积的差
{
cnt=cnt-1; //用cnt+1表示进栈,cnt-1表示出栈
flag[++l]=0; //用flag的数组记录每一次的进栈与出栈
j++;
}
else
{
str3[++cnt]=str1[++i]; //进站,出站,//进站,进站,出站//进站,进站,出站,出站 //
flag[++l]=1;
}
}
if(cnt==0)
{
printf("Yes.\n");
for(i=0;i<=l;i++)
if(flag[i]==1)
printf("in\n");
else
printf("out\n");
}
else
printf("No.\n");
printf("FINISH\n");
}
return 0;
}