2955 Brackets

/*
Brackets
Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 7541		Accepted: 4007
Description


We give the following inductive definition of a “regular brackets” sequence:


the empty sequence is a regular brackets sequence,
if s is a regular brackets sequence, then (s) and [s] are regular brackets sequences, and
if a and b are regular brackets sequences, then ab is a regular brackets sequence.
no other sequence is a regular brackets sequence
For instance, all of the following character sequences are regular brackets sequences:


(), [], (()), ()[], ()[()]


while the following character sequences are not:


(, ], )(, ([)], ([(]


Given a brackets sequence of characters a1a2 … an, your goal is to find the length of the longest regular brackets sequence that is a subsequence of s. That is, you wish to find the largest m such that for indices i1, i2, …, im where 1 ≤ i1 < i2 < … < im ≤ n, ai1ai2 … aim is a regular brackets sequence.


Given the initial sequence ([([]])], the longest regular brackets subsequence is [([])].


Input


The input test file will contain multiple test cases. Each input test case consists of a single line containing only the characters (, ), [, and ]; each input test will have length between 1 and 100, inclusive. The end-of-file is marked by a line containing the word “end” and should not be processed.


Output


For each input case, the program should print the length of the longest possible regular brackets subsequence on a single line.


Sample Input


((()))
()()()
([]])
)[)(
([][][)
end
Sample Output


6
6
4
0
6
*/




#include <string>
#include <iostream>
#include <vector>
#include <algorithm>


using namespace std;




size_t longest_regular(const string & str) {
    std::vector<std::vector<size_t > > record(
        str.length(), 
        std::vector<size_t>(
            str.length(), 
            0));


    for (int i = 1; i < str.length(); i++) {
        if (str[i] == '(' || str[i] == '[') {
            for (int j = 0; j < i; j++) {
                record[j][i] = record[j][i - 1];
            }
        }
        else {
            const char wanted = (str[i] == ')' ? '(' : '[');
            for (int j = i - 1; j >= 0; --j) {
                for (int k = i; k >= j; --k) {
                    size_t left = k != j ? record[j][k - 1] : 0;
                    size_t right = k != i ? record[k + 1][i - 1] : 0;
                    if (str[k] == wanted) {
                        right += 2;
                    }
                    record[j][i] = std::max(
                        record[j][i], 
                        left + right);
                }
            }
        }
    }


    return record[0][str.length() - 1];
}


int main()
{
    string str;
    while (cin >> str) {
        if (str == "end") {
            break;
        }
        cout << longest_regular(str) << endl;
    }
    return 0;
}