zoukankan      html  css  js  c++  java
  • 1183. Brackets Sequence

    Let us define a regular brackets sequence in the following way:
    1. Empty sequence is a regular sequence.
    2. If S is a regular sequence, then (S) and [S] are both regular sequences.
    3. If A and B are regular sequences, then AB is a regular sequence.
    For example, all of the following sequences of characters are regular brackets sequences:
    (), [], (()), ([]), ()[], ()[()]
    And all of the following character sequences are not:
    (, [, ), )(, ([)], ([(]
    Some sequence of characters '(', ')', '[', and ']' is given. You are to find the shortest possible regular brackets sequence, that contains the given character sequence as a subsequence. Here, a string a1a2...an is called a subsequence of the string b1b2...bm, if there exist such indices 1 ≤ i1 < i2 < ... < in ≤ m, that aj=bij for all 1 ≤ j ≤ n.

    Input

    The input contains at most 100 brackets (characters '(', ')', '[' and ']') that are situated on a single line without any other characters among them.

    Output

    Write a single line that contains some regular brackets sequence that has the minimal possible length and contains the given sequence as a subsequence.

    Sample

    inputoutput
    ([(]
    ()[()]
    Problem Author: Andrew Stankevich  Problem Source: 2001-2002 ACM Northeastern European Regional Programming Contest
  • 相关阅读:
    HDU5195 线段树+拓扑
    Codeforces Round #328 (Div. 2)D. Super M 虚树直径
    HDU5489 LIS变形
    BZOJ 1787: [Ahoi2008]Meet 紧急集合 LCA
    Codeforces Round #330 (Div. 2)B. Pasha and Phone 容斥
    Codeforces Round #330 (Div. 2) D. Max and Bike 二分
    Codeforces Round #277 (Div. 2) E. LIS of Sequence DP
    Codeforces Round #277 (Div. 2) D. Valid Sets DP
    内存对齐
    mui列表跳转到详情页优化方案
  • 原文地址:https://www.cnblogs.com/sdau--codeants/p/3229629.html
Copyright © 2011-2022 走看看