You’re typing a long text with a broken keyboard. Well it’s not so badly broken. The only problemwith 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 themonitor! 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,000letters, underscores and two special characters ‘[’ and ‘]’. ‘[’ means the “Home” key is pressedinternally, 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
#include <iostream> #include <cstdio> #include <cstring> #include <algorithm> using namespace std; #define BG 100005 char s[BG]; int nextt[BG]; int main() { while(scanf("%s",s+1)!=EOF) { int i,l; int cur,last; l=(int)strlen(s+1); cur=last=0;//cur and last seems the chars that have been pointed nextt[0]=0;//seems its pointer is null for(i=1;i<=l;i++) { if(s[i]=='[') cur=0; else if(s[i]==']') cur=last; else { nextt[i]=nextt[cur];//pass the pointer down nextt[cur]=i;//when i==15,cur==14(the 1st data) if(cur==last)//refresh cur and last in the end(the current char has been pointed. last=i; cur=i;//cur shift to the next pos } } i=nextt[0]; while(i!=0) { printf("%c",s[i]); i=nextt[i]; } printf("\n"); } }