码迷,mamicode.com
首页 > 其他好文 > 详细

UVA - 11988

时间:2014-11-26 11:09:37      阅读:142      评论:0      收藏:0      [点我收藏+]

标签:style   blog   http   io   ar   color   os   sp   for   

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

Rujia Liu‘s Present 3: A Data Structure Contest Celebrating the 100th Anniversary of Tsinghua University
Special Thanks: Yiming Li
Note: Please make sure to test your program with the gift I/O files before submitting!

bubuko.com,布布扣
 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 
 5 using namespace std;
 6 
 7 int next[100011];
 8 char str[100010];
 9 int main () {
10     // freopen("1.in","r",stdin);
11     while (scanf("%s",str + 1) != EOF) {
12         memset(next,0,sizeof(next));
13         int cur = 0,last = 0;
14         for (int i = 1,len = strlen(str + 1);i <= len;i++) {
15             if (str[i] == [) cur = 0;
16                 else if (str[i] == ]) cur = last;
17                 else {
18                     next[i] = next[cur];
19                     next[cur] = i;
20                     if (cur == last) last = i;
21                     cur = i;
22                 }
23         }
24         for (int i = next[0];i != 0;i = next[i]) {
25             cout << str[i];
26         }
27         cout << endl;
28     }
29 }
View Code

 

UVA - 11988

标签:style   blog   http   io   ar   color   os   sp   for   

原文地址:http://www.cnblogs.com/xiaoshanshan/p/4122582.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!