UVA11988 模拟题，水

1

#include <iostream>
#include <string.h>
#include <stack>

using namespace std;
int main()
{
string shuru;
string text;
string temp;
stack <int > pos;
int visted[100010];
while(cin>>shuru){
memset(visted,0,sizeof(visted));
int len=shuru.length();
for(int i=0;i<len;i++){
if(shuru[i]=='['){
pos.push(i);
}
}
while(!pos.empty()){
int cur=pos.top()+1;
pos.pop();
if(cur==len){
continue;//注意边界！！不要越界
}

while(shuru[cur]!='['&&shuru[cur]!=']'){
cout<<shuru[cur];
visted[cur]=1;
cur++;
if(cur==len) break;//注意边界！
}
}
for(int i=0;i<len;i++){
if(visted[i]==0&&shuru[i]!='['&&shuru[i]!=']'){
cout<<shuru[i];
}
}

cout<<endl;
}
return 0;
}

2

Description

 

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

Sample Output

 

BeijuThis_is_a__text
Happy_Birthday_to_Tsinghua_University