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


            久久精品人人做人人爽97| 久久综合伊人77777| 久久婷婷五月综合97色一本一本| 久久婷婷色香五月综合激情| 久久精品卫校国产小美女| 久久精品国产亚洲AV麻豆网站 | 久久婷婷国产综合精品| 99久久精品国产一区二区三区| 一级做a爰片久久毛片毛片| 久久久国产精品网站| 久久久亚洲裙底偷窥综合| 国产成人无码精品久久久免费 | 亚洲伊人久久成综合人影院| 嫩草伊人久久精品少妇AV| 亚洲国产成人久久综合一区77 | 久久精品一区二区国产| 亚洲国产精品无码久久SM| 国产成人精品久久综合| 欧美日韩久久中文字幕| 美女写真久久影院| 国产精品国色综合久久| 欧美日韩精品久久久久| 久久人妻少妇嫩草AV无码蜜桃| 99久久精品毛片免费播放| 欧美噜噜久久久XXX| 久久精品国产99国产精品导航 | 精品无码久久久久久午夜| 亚洲精品无码久久久久sm| 亚洲午夜无码AV毛片久久| 久久综合久久综合久久| 老司机国内精品久久久久| avtt天堂网久久精品| 99久久99久久精品国产片果冻| 欧美粉嫩小泬久久久久久久 | 97精品久久天干天天天按摩| 久久亚洲精品国产精品婷婷 | 伊人久久综合无码成人网| 久久久精品人妻一区二区三区蜜桃| 久久久久久久综合综合狠狠| 国产情侣久久久久aⅴ免费| 久久久综合九色合综国产|