Brackets POJ - 2955 （区间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 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[s][r]=max(dp[s][r],dfs(s,i)+dfs(i+1,r));

要么不划分：边界配对结果+去边界区间最优解（一定要缩小区间范围）

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int dp[111][110];
char a[1100];
int dfs(int s,int r)
{
	int j,i;

	if(dp[s][r]!=-1) return dp[s][r];
	if(s>=r) return 0;

	if(a[s]=='('&&a[r]==')'||a[s]=='['&&a[r]==']')
	{
		dp[s][r]=2;
	}

	dp[s][r]+=dfs(s+1,r-1);

	for(i=s; i<r; i++)
	{
		dp[s][r]=max(dp[s][r],dfs(s,i)+dfs(i+1,r));
	}
	return dp[s][r];
}
int main()
{
	int n,m,j,i,L;
	char b[4]="end";
	while(~scanf("%s",a+1)&&strcmp(a+1,b)!=0)
	{
		memset(dp,-1,sizeof(dp));
		L=strlen(a+1);
		printf("%d\n",dfs(1,L));
		memset(a,'\0',sizeof(a));
	}
	return 0;
}