Train Problem I

问题陈述：

　　杭州电子科技大学HANGZHOU DIANZI UNIVERSITY Online Judge Problem - 1022

问题解析：

　　栈(stack)的简单应用

代码详解：　　

 #include <iostream>
 #include <cstdio>
 #include <stack>
 #include <cstring>

 using namespace std;

 stack<int> s;

 int flag[];

 int main()
 {
     int n, i, j, k;
     char o1[], o2[];
     while(~scanf("%d %s%s", &n, o1, o2)){
         while(!s.empty()){
             s.pop();
         }
         memset(flag, -, sizeof(flag));
         j = k = ;
         for(i=; i<n; i++) {
             s.push(o1[i]);
             flag[k++] = ;
             while(!s.empty() && s.top()==o2[j]) {
                 s.pop();
                 flag[k++] = ;
                 j++;
             }
         }
         if(j == n) {
             cout << "Yes." <<endl;
             for(i=; i<k; i++) {
                 if(flag[i]) {
                     cout << "in" <<endl;
                 }else {
                     cout << "out" << endl;
                 }
             }
         }else {
             cout << "No." << endl;
         }
         cout << "FINISH" << endl;
     }
     return ;
 }

参考博客：http://blog.csdn.net/lyhvoyage/article/details/18505997

转载请注明出处：http://www.cnblogs.com/michaelwong/p/4315668.html