UVa-11988-Broken Keyboard (a.k.a. Beiju Text)

11988-Broken Keyboard (a.k.a. Beiju Text)

Description：

You’re typing along text with a broken keyboard. Well it’s not so badly broken. The onlyproblem with the keyboard is that sometimes the “home” key or the “end” keygets automatically pressed (internally). You’re not aware of this issue, sinceyou’re focusing on the text and did not even turn on the monitor! After youfinished typing, you can see a text on the screen (if you turn on the monitor).

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

Input：

There areseveral test cases. Each test case is a single line containing at least one andat most 100,000 letters, underscores and two special characters ‘[’ and ‘]’. ‘[’meansthe “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

Code：

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;

const int maxn(1e5+10);
char input[maxn];/* store input*/
char ans[maxn<<1];/*store answer*/
int left_index,right_index;
int cnt;
int start;
bool flag;
int main()
{
    while(gets(input))
    {
        /*initialize variable*/
        memset(ans,0,sizeof(ans));
        left_index = right_index = maxn;
        flag = true;
        cnt = 0;
        for(int i = 0; i < strlen(input); i++)
        {
            switch(input[i])
            {
            case '[':
                if(flag)
                {
                    flag = false;
                    start = i + 1;
                }
                else
                {
                    for(int i = 0; i < cnt; i++)
                    {
                        ans[left_index + i] = input[start + i];
                    }
                    cnt = 0;
                    start = i + 1;
                }
                break;
            case ']':
                if(flag)
                {
                    continue;
                }
                else
                {
                    for(int i = 0; i < cnt; i++)
                    {
                        ans[left_index + i] = input[start + i];
                    }
                    flag = true;
                    cnt = 0;
                }
                break;
            default:
                if(flag)
                {
                    ans[right_index++] = input[i];
                }
                else
                {
                    left_index--;
                    cnt++;
                }
                break;
            }
        }
        if(!flag && start < strlen(input))
        {
            for(int i = 0; i < cnt; i++)
            {
                ans[left_index + i] = input[start + i];
            }
        }
        puts(ans + left_index);
    }
    return 0;
}