Description
![Download as PDF Download as PDF](http://uva.onlinejudge.org/components/com_onlinejudge/images/button_pdf.png)
Problem B
Broken Keyboard (a.k.a. Beiju Text)
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). The size of input file does not exceed 5MB.
Output
For each case, print the Beiju text on the screen.
Sample Input
This_is_a_[Beiju]_text [[]][][]Happy_Birthday_to_Tsinghua_University
Output for the Sample Input
BeijuThis_is_a__text Happy_Birthday_to_Tsinghua_University
题解:链表应用,利用next数组表示下一个的链接。
此题是要你把[]内的数据放在开头,所以遇到【时就要把开头的next给【的后一个,令cur = 0;
后遇到】,就把cur的位置回恢复到原来遇到【之前一个数;
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 100000+5;
int cur,last,nextItem[maxn];
char str[maxn];
int main(){
while(scanf("%s",str+1) == 1){
cur = last = 0;
int len = strlen(str+1);
nextItem[0] = 0;
for(int i = 1; i <= len ; i++){
char ch = str[i];
if('[' == ch) cur = 0;
else if(']' == ch) cur = last;
else{
nextItem[i] = nextItem[cur];
nextItem[cur] = i;
if(cur == last) last = i;
cur = i;
}
}
for(int i = nextItem[0]; i!= 0; i = nextItem[i]){
printf("%c",str[i]);
}
cout<<endl;
}
return 0;
}