Brackets

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 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

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

const int maxn=110;
char str[maxn];
int dp[maxn][maxn];
/*
 状态转移的方向，应该是在已经求出来的子状态，往上递推
 我们枚举 起点 终点像是 (a)，但是起点和终点一定就是最佳匹配么，
 不一定，有可能是ab类型的,所以我们需要找到i-j的最大值
*/
int main()
{
	while(~scanf("%s",&str)) {
		if(str[0]=='e') break;
		memset(dp,0,sizeof(dp));
		int len=strlen(str);
		for(int i=len-1; i>=0; i--) {
			for(int j=i+1; j<len; j++) {
				if(str[i]=='('&&str[j]==')'||str[i]=='['&&str[j]==']')
					dp[i][j] =dp[i+1][j-1]+2;
				for(int k=i; k<=j; k++)
					dp[i][j]=max(dp[i][j],dp[i][k]+dp[k][j]);
			}
		}
		printf("%d\n",dp[0][len-1]);
	}
	return 0;
}
/*
错误的做法
想着匹配一个是一个
[(])这样的例子就错了
还有就是那个判断的语句，错了好几遍
while((j>=0&&str[j]!='(')||(str[j]=='('&&vis[j])) {	j--;} 
还是基础不太牢固 
*/