HDU 1022(火车过站 栈)

 1 #include <bits/stdc++.h>
 2 using namespace std;
 3 int main()
 4 {
 5     std::ios::sync_with_stdio(false);
 6     int n,pos,cnt,vis[1000];
 7     stack<char> q;
 8     char come[1000],go[1000];
 9     while(cin >> n)
10     {
11         cin >> come >> go;
12         pos = 0;
13         cnt = 0;
14         while(!q.empty()) q.pop();
15         memset(vis,-1,sizeof(vis));
16         for(int i = 0; i < n; i++)
17         {
18             vis[cnt++] = 1;
19             q.push(come[i]);
20             while(!q.empty()&&q.top() == go[pos])
21             {
22                 q.pop();
23                 pos++;
24                 vis[cnt++] = 0;
25             }
26         }
27         if(pos==n)
28         {
29             cout << "Yes.\n";
30             for(int i = 0; i < cnt; i++)
31             {
32                 if(vis[i]) cout << "in\n";
33                 else cout << "out\n";
34             }
35         }
36         else cout << "No.\n";
37         cout << "FINISH\n";
38     }
39     return 0;
40 }