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


            久久国产V一级毛多内射| 久久久久成人精品无码中文字幕| 久久国产乱子伦免费精品| 久久综合精品国产二区无码| 99精品国产在热久久| 久久久久久无码国产精品中文字幕 | 伊人热人久久中文字幕| 日产精品久久久久久久| 国内精品伊人久久久久av一坑| 国产成人综合久久久久久| 久久香蕉超碰97国产精品| 91久久福利国产成人精品| 久久久久亚洲国产| 久久久99精品一区二区| 色欲综合久久中文字幕网| 一级做a爰片久久毛片看看| 91精品日韩人妻无码久久不卡| 午夜精品久久久久久影视777| 久久天天日天天操综合伊人av| 免费国产99久久久香蕉| 99久久久国产精品免费无卡顿| 久久一区二区三区99| 国产精品免费久久久久久久久| 免费精品久久久久久中文字幕| 久久国产高清字幕中文| 久久亚洲精品无码观看不卡| 久久发布国产伦子伦精品| 97久久婷婷五月综合色d啪蜜芽| 伊人久久大香线蕉综合热线| 88久久精品无码一区二区毛片| 久久久无码精品亚洲日韩蜜臀浪潮 | 久久成人影院精品777| 青青草原综合久久大伊人导航| 狠狠色丁香婷综合久久| 久久夜色精品国产噜噜亚洲AV| 国产成人精品综合久久久| 久久婷婷五月综合色奶水99啪| 狠狠综合久久综合中文88| 99久久夜色精品国产网站| 午夜不卡888久久| 国产精品青草久久久久婷婷|