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


            久久久网中文字幕| 嫩草伊人久久精品少妇AV| 久久精品人人做人人爽电影| 伊人久久大香线蕉精品不卡| 99久久久国产精品免费无卡顿| 精品熟女少妇av免费久久| 国产精品久久久久久吹潮| 99久久国产亚洲高清观看2024 | 97久久综合精品久久久综合| 久久久久国产一区二区三区| 久久只有这精品99| 国产精品xxxx国产喷水亚洲国产精品无码久久一区 | 色欲av伊人久久大香线蕉影院| 国内精品久久国产| 91精品国产色综合久久| 久久久精品人妻无码专区不卡| 99久久国产综合精品女同图片| 狠狠狠色丁香婷婷综合久久五月| 久久婷婷五月综合成人D啪| 狠狠色丁香久久综合婷婷| 久久福利资源国产精品999| 精品免费tv久久久久久久| 国内精品伊人久久久久妇| 国产AV影片久久久久久| 国产V综合V亚洲欧美久久| 无码任你躁久久久久久| 久久婷婷五月综合色99啪ak| 丰满少妇人妻久久久久久| 久久精品国产色蜜蜜麻豆| 久久久久亚洲AV综合波多野结衣 | 久久综合九色综合欧美就去吻| 伊人色综合久久| 国产精品久久亚洲不卡动漫| 久久久精品国产sm调教网站 | 亚洲精品无码久久毛片| 情人伊人久久综合亚洲| 精品午夜久久福利大片| 潮喷大喷水系列无码久久精品| 亚洲AV无码成人网站久久精品大| 国产精品久久久久久久久软件| 久久久久亚洲AV成人网|