• <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 閱讀(539) 評論(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无码精品色午夜| 国产精品午夜久久| 久久国产劲爆AV内射—百度| 国产亚洲精品久久久久秋霞| 久久精品国产亚洲av麻豆小说| 久久精品国产精品国产精品污 | 久久精品人人做人人爽97 | 久久精品二区| 久久精品国产亚洲AV香蕉| www.久久精品| 综合人妻久久一区二区精品 | 四虎国产精品成人免费久久| 亚洲中文久久精品无码| 久久99精品国产99久久6| 少妇久久久久久久久久| 久久精品亚洲福利| 精品久久久久久国产91| 久久SE精品一区二区| 手机看片久久高清国产日韩| 国产高潮国产高潮久久久| 国产精品久久婷婷六月丁香| 久久成人国产精品二三区| 久久影院综合精品| 亚洲综合精品香蕉久久网| 久久久久国产一区二区| 国产高潮久久免费观看| 国产精品99久久免费观看| 天堂久久天堂AV色综合| 久久久久久国产精品无码下载| 国产三级精品久久| 岛国搬运www久久| 久久精品国内一区二区三区| 久久久久久国产精品免费无码 | 日本三级久久网| 国产精品视频久久| 国产精品久久国产精品99盘| 精品久久久久久亚洲精品 | 蜜桃麻豆www久久| 久久精品一区二区三区不卡| 久久精品国产91久久麻豆自制| 97久久超碰成人精品网站|