题解--the empty sequence is a regular

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

题意：括号匹配，求最长子串符合匹配规则，子串内有几个元素 。

思路：dp[i][j]表示i到j内的最长符合规则子串。

           全部初始化为零。

           外层由后向前遍历，内层由i 向后遍历，k从i向j 遍历，ps:注意字符串起始位置，以及符号匹配是成对的。

          状态转移方程：

           dp[i][j]=max(dp[i][j],dp[i][k]+dp[k+1][j]);
           if((s[i]=='('&&s[j]==')')||(s[i]=='['&&s[j]==']')){
                  dp[i][j]=max(dp[i][j],dp[i+1][j-1]+2);
            }

代码：

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main(){
    string s;
    while(cin>>s){
        if(s[0]=='e'){
            return 0;
        }
        int dp[105][105]={0};
        int len=s.length();
        for(int i=len-2;i>=0;i--){
            for(int j=i+1;j<=len-1;j++){
                for(int k=i;k<j;k++){
                    dp[i][j]=max(dp[i][j],dp[i][k]+dp[k+1][j]);
                    if((s[i]=='('&&s[j]==')')||(s[i]=='['&&s[j]==']')){
                        dp[i][j]=max(dp[i][j],dp[i+1][j-1]+2);
                    }

                }
            }
        }
        cout<<dp[0][len-1]<<endl;
    }
    return 0;
}