• <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;
            }


            国内高清久久久久久| 久久精品国产91久久麻豆自制| 久久黄色视频| 久久精品毛片免费观看| 亚洲乱亚洲乱淫久久| 亚洲国产精品一区二区三区久久| 欧美噜噜久久久XXX| 99久久久久| 精品国产VA久久久久久久冰 | 国内精品人妻无码久久久影院| 久久久精品国产sm调教网站| 久久丝袜精品中文字幕| 久久精品aⅴ无码中文字字幕不卡| 久久婷婷人人澡人人| 精品999久久久久久中文字幕| 日批日出水久久亚洲精品tv| 久久97精品久久久久久久不卡| 久久精品国产亚洲av麻豆图片| 办公室久久精品| 久久精品国产亚洲综合色 | 精品亚洲综合久久中文字幕| 天天影视色香欲综合久久| 99久久精品免费| 日本精品久久久久中文字幕| 国产高潮国产高潮久久久| 日韩欧美亚洲综合久久| 久久婷婷是五月综合色狠狠| 色婷婷狠狠久久综合五月| 国产福利电影一区二区三区,免费久久久久久久精 | 久久久久国产精品熟女影院| 亚洲中文字幕无码久久2017| 亚洲国产天堂久久综合| 性做久久久久久久久| 欧美精品一区二区久久| 亚洲伊人久久成综合人影院| 久久免费国产精品| 一级a性色生活片久久无少妇一级婬片免费放| 久久99精品久久久久久噜噜| 久久涩综合| 久久99精品久久久大学生| 久久亚洲精品成人AV|