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


            久久综合噜噜激激的五月天| 国内精品人妻无码久久久影院 | 伊人热热久久原色播放www| 国产成人精品三上悠亚久久| 国产精品免费久久久久电影网| 久久天天躁狠狠躁夜夜2020一| 久久不射电影网| 狠狠精品久久久无码中文字幕| 国产午夜精品久久久久九九电影 | 久久久久无码精品国产| 国产精品女同一区二区久久| 色综合久久久久久久久五月| 看全色黄大色大片免费久久久 | 国产精品久久久久久久久久影院| 国产成人精品久久一区二区三区| 怡红院日本一道日本久久 | 亚洲国产精品成人久久蜜臀| 九九久久99综合一区二区| 一本色道久久HEZYO无码| 久久婷婷色综合一区二区| 欧美激情精品久久久久| 久久99精品久久久久久久不卡 | 久久婷婷五月综合色奶水99啪 | 日本欧美国产精品第一页久久| 99久久无码一区人妻| 国产精品久久久久无码av| 色综合久久综合中文综合网| 久久中文字幕人妻熟av女| 亚洲午夜精品久久久久久浪潮 | 久久夜色精品国产www| 97精品伊人久久久大香线蕉| 97热久久免费频精品99| 久久久久久久久无码精品亚洲日韩 | 久久综合伊人77777麻豆| 久久福利片| 久久精品国产亚洲精品| 国产亚洲色婷婷久久99精品91| 国产成人久久久精品二区三区| 91亚洲国产成人久久精品网址 | 久久人人爽人人爽人人片av麻烦| 久久久久亚洲AV无码专区首JN|