Brackets (区间dp)

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 a₁a₂ … a_n, 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 i₁, i₂, …, i_m where 1 ≤ i₁ < i₂ < … < i_m ≤ n, a_i1a_i2 … a_im 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，dp[l][r] 表示l到r的字符串能够形成的最大括号匹配数量

           dp[l][r]=max(  dp[l][r]  ,   dp[l][k]  +   dp[k+1][r]   ) ，，，k 为l 和 r 之间的一个断点

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
const int N = 110;
int dp[N][N];
char str[N];
int match(char a,char b){
	if(a=='(') return b==')';
	else if(a=='[') return b==']';
	else return 0;
}
int main(){
	while(scanf("%s",str)!=EOF&&str[0]!='e'){
		memset(dp,0,sizeof(dp));
		int n=strlen(str);
		for(int i=0;i<n;i++)
		   if(match(str[i],str[i+1])) dp[i][i+1]=2;
		for(int len=3;len<=n;len++){
			for(int l=0,r;(r=l+len-1)<n;l++){
				if(match(str[l],str[r])) dp[l][r]=dp[l+1][r-1]+2;
				for(int k=l;k<r;k++)
				   dp[l][r]=max(dp[l][r],dp[l][k]+dp[k+1][r]);
			}
		}
		printf("%d\n",dp[0][n-1]);
	}
	return 0;
}