• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>
            posts - 21, comments - 2, trackbacks - 0, articles - 0
            題目地址:http://acm.hdu.edu.cn/showproblem.php?pid=1022
            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. in in in out out out FINISH No. FINISH 下面是代碼,第一次使用C++的STL模板,用的很不熟練,不過沒想到1Y就過了~~~YY。。。
            #include<cstdio>
            #include
            <stack>
            using namespace std;
            int main()
            {
                
            int i,j,k,n,ok,flg[22];
                
            char in[10],out[10];
                
            while(scanf("%d",&n)!=EOF)
                
            {
                    scanf(
            "%s%s",in,out);
                    stack
            <int> s;
                    i
            =j=k=0;ok=1;
                    
            while(j<n)
                    
            {
                        
            if(in[i]==out[j])
                        
            {
                            flg[k
            ++]=0;flg[k++]=1;i++;j++;
                        }

                        
            else if(!s.empty() && s.top()==(out[j]-'0'))
                        
            {
                            flg[k
            ++]=1;s.pop();j++;
                        }

                        
            else if(i<n)
                        
            {
                            s.push(
            in[i++]-'0');flg[k++]=0;
                        }

                        
            else 
                        
            {
                            ok
            =0;break;
                        }

                    }

                    
            if(ok==0)printf("No.\n");
                    
            else
                    
            {
                        printf(
            "Yes.\n");
                        
            for(i=0;i<k;i++)
                        
            {
                            
            if(flg[i]==0)printf("in\n");
                            
            else printf("out\n");
                        }

                    }

                    printf(
            "FINISH\n");
                }

                
            return 0;
            }


            久久久久人妻精品一区二区三区 | 99久久精品毛片免费播放| 一级a性色生活片久久无少妇一级婬片免费放 | 亚洲国产成人久久综合一| 久久久久国产一区二区三区| 国产精品乱码久久久久久软件| 蜜臀av性久久久久蜜臀aⅴ | MM131亚洲国产美女久久| 一级做a爰片久久毛片人呢| 欧美久久一区二区三区| 色欲久久久天天天综合网| 国产欧美久久一区二区| 狠狠色丁香久久婷婷综合蜜芽五月| 久久久久久国产精品免费无码| 国产精品xxxx国产喷水亚洲国产精品无码久久一区 | 91久久精品91久久性色| 久久午夜综合久久| 2022年国产精品久久久久| 无码人妻少妇久久中文字幕| 国内精品伊人久久久久av一坑| 久久久人妻精品无码一区| 久久91精品国产91久久麻豆| 亚洲成色www久久网站夜月| 日韩AV毛片精品久久久| 99久久精品费精品国产| 久久久精品2019免费观看| 亚洲国产日韩欧美久久| 国产成人综合久久久久久| 69SEX久久精品国产麻豆| 色偷偷偷久久伊人大杳蕉| 热99RE久久精品这里都是精品免费 | 99精品久久久久久久婷婷| 亚洲性久久久影院| 色偷偷91久久综合噜噜噜噜| 青草影院天堂男人久久| 潮喷大喷水系列无码久久精品| 婷婷伊人久久大香线蕉AV| 国产69精品久久久久APP下载| 亚洲国产成人久久一区久久| 区亚洲欧美一级久久精品亚洲精品成人网久久久久 | 国产精品美女久久久网AV|