• <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 閱讀(546) 評論(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;
            }


            久久国产成人| 久久综合狠狠综合久久| 精品久久国产一区二区三区香蕉| 国产精品岛国久久久久| 久久久久免费视频| 99久久人妻无码精品系列蜜桃| 久久国产午夜精品一区二区三区| 亚洲国产精品无码久久一区二区| 国产精品毛片久久久久久久| 国产激情久久久久影院| 亚洲AV无码久久精品狠狠爱浪潮 | 国产∨亚洲V天堂无码久久久| 国产国产成人久久精品| 久久精品国产亚洲av麻豆色欲| 久久久WWW成人免费毛片| 久久精品国产亚洲AV高清热 | 色欲久久久天天天综合网精品| 大香网伊人久久综合网2020| 人妻精品久久久久中文字幕一冢本 | 国产亚洲美女精品久久久久狼| 亚洲狠狠婷婷综合久久蜜芽| 精品久久久久久无码不卡| 97久久香蕉国产线看观看| 香蕉久久av一区二区三区| 欧美亚洲国产精品久久久久| 久久久久国产精品麻豆AR影院 | 日本久久久精品中文字幕| 国产精品久久久福利| AAA级久久久精品无码片| 亚洲AV无码久久寂寞少妇| 麻豆精品久久久久久久99蜜桃 | 66精品综合久久久久久久| 欧美综合天天夜夜久久| 久久精品国产精品青草app| 国产精品久久久福利| 青青草国产精品久久| 久久99国产精一区二区三区| 国产精品久久毛片完整版| 91久久精品视频| 久久婷婷色综合一区二区| 四虎影视久久久免费|