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

            HDU 1022 Train Problem I_數據結構_棧

            Posted on 2011-08-26 18:04 acpeng 閱讀(540) 評論(0)  編輯 收藏 引用 所屬分類: ACM程序
            題目地址: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;
            }


            国产精品禁18久久久夂久| 中文精品久久久久人妻| 久久久亚洲欧洲日产国码二区 | 久久国产乱子伦精品免费午夜| 久久久久中文字幕| 国产精品美女久久福利网站| 99蜜桃臀久久久欧美精品网站| 久久久久AV综合网成人| 久久福利片| 色婷婷综合久久久久中文| 久久久99精品成人片中文字幕| 亚洲中文字幕无码久久综合网| 久久久91精品国产一区二区三区| 狠狠色综合久久久久尤物| 久久亚洲精品无码VA大香大香| 久久综合九色综合97_久久久| 久久精品国产日本波多野结衣| 青青草国产精品久久久久| 亚洲精品高清国产一线久久 | 久久性生大片免费观看性| 午夜不卡久久精品无码免费| 无码乱码观看精品久久| 品成人欧美大片久久国产欧美| 色诱久久久久综合网ywww| 国产精品一区二区久久精品涩爱 | 久久久久久精品久久久久| 一级做a爰片久久毛片人呢| 熟妇人妻久久中文字幕| 99久久做夜夜爱天天做精品| 欧美久久亚洲精品| 99久久国产综合精品成人影院| 99久久中文字幕| 久久久久久亚洲Av无码精品专口 | 狠狠色噜噜狠狠狠狠狠色综合久久| 久久久国产99久久国产一| 亚洲国产成人久久一区WWW| 日本久久久久久中文字幕| 51久久夜色精品国产| 亚洲国产精品久久久久婷婷软件 | 国产69精品久久久久APP下载| 精品久久久久中文字幕一区|