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


            亚洲精品乱码久久久久久蜜桃图片| 久久最新精品国产| 99久久免费国产精品特黄| 久久精品水蜜桃av综合天堂| 久久亚洲国产精品一区二区| 色偷偷888欧美精品久久久| 久久久久噜噜噜亚洲熟女综合| 亚洲&#228;v永久无码精品天堂久久 | 久久免费大片| 青青青青久久精品国产| 日日狠狠久久偷偷色综合96蜜桃 | 久久精品国产99国产电影网 | 久久人人爽人人爽人人av东京热| 久久精品国产亚洲沈樵| 伊人久久无码精品中文字幕| 国产免费久久久久久无码| 久久久综合九色合综国产| 亚洲一级Av无码毛片久久精品| 久久久久无码精品国产| 久久久久久久久66精品片| 无码人妻少妇久久中文字幕| 久久综合久久自在自线精品自| 99久久这里只精品国产免费| 国产综合精品久久亚洲| 久久亚洲高清综合| 久久99国产精品一区二区| 无遮挡粉嫩小泬久久久久久久| 久久久不卡国产精品一区二区| 丰满少妇人妻久久久久久| 国产欧美一区二区久久| 性欧美丰满熟妇XXXX性久久久| 人人狠狠综合久久亚洲高清| 精品久久久久久久中文字幕| 久久亚洲国产精品一区二区| 亚洲成色999久久网站| 要久久爱在线免费观看| 久久性精品| 性高朝久久久久久久久久| 久久久国产精品| 久久久精品人妻无码专区不卡| 精品久久久久久无码中文野结衣|