D - Broken Keyboard (a.k.a. Beiju Text) (破损的键盘)

Posted 2020-09-29 山杉三

You’re typing a long text with a broken keyboard. Well it’s not so badly broken. The only problem with the keyboard is that sometimes the “home” key or the “end” key gets automatically pressed (internally).

You’re not aware of this issue, since you’re focusing on the text and did not even turn on the monitor! After you finished typing, you can see a text on the screen (if you turn on the monitor).

In Chinese, we can call it Beiju. Your task is to find the Beiju text.

Input

There are several test cases. Each test case is a single line containing at least one and at most 100,000 letters, underscores and two special characters ‘[’ and ‘]’. ‘[’ means the “Home” key is pressed internally, and ‘]’ means the “End” key is pressed internally. The input is terminated by end-of-file (EOF).

Output

For each case, print the Beiju text on the screen.

Sample Input

This_is_a_[Beiju]_text

[[]][][]Happy_Birthday_to_Tsinghua_University Sample

Output

BeijuThis_is_a__text

Happy_Birthday_to_Tsinghua_University

解法:

 1 #include <iostream>
 2 #include <string.h>
 3 
 4 using namespace std;
 5 
 6 const int MAX = 100000 + 2000;
 7 
 8 int main()
 9 {
10     char a[MAX];
11 
12     while(cin>>(a+1))
13     {
14         int len = strlen(a+1);
15         int next[MAX];
16         int last = 0,cur = 0;
17         next[0] = 0;
18         for(int i = 1;i <=len;i++)
19         {
20             char ch = a[i];
21             if( ch == ‘[‘) cur = 0;
22             else if(ch == ‘]‘) cur = last;
23             else {
24                 next[i] = next[cur];
25                // cout<<"i  == cur == netx[i] == netx[cur]="<<i<<cur<<next[i]<<next[cur]<<endl;
26 
27                 next[cur] = i;
28                // cout<<"cur **==netx[cur] **== "<<cur<<"   "<<next[cur]<<endl;
29 
30                 if(cur == last) last = i;
31                 cur = i;
32                //cout<<"cur last =="<<cur<<last<<endl;
33             }
34         }
35         for(int i = next[0];i!=0;i =next[i])
36                 cout<<a[i];
37         cout<<endl;
38     }
39 
40     return 0;
41 }