POJ 2955 Brackets（区间DP）

题意：给你一串由（）[ ] 组成的序列，问能匹配的最大长度是多少

思路：区间DP入门，定义dp[i][j]为区间i到j的最大匹配数，若s[i]=='('&&s[j]==')'的话显然有dp[i][j]=dp[i+1][j-1]+2，接下来更新区间dp[i][j]=max(dp[i][j],dp[i][k]+dp[k+1][j])

#include <cstdio>
#include <queue>
#include <cstring>
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <set>
#include <ctime>
#include <cmath>
#include <cctype>
using namespace std;
#define maxn 105
#define LL long long
int cas=1,T;
int dp[maxn][maxn];
int main()
{
	string s1;
	while (cin >> s1 && s1[0]!='e')
	{
        memset(dp,0,sizeof(dp));
		int len=s1.size();
		for (int k=1;k<len;k++)
		{
			for (int i = 0,j=k;i<len,j<len;i++,j++)
			{
                if (s1[i]=='(' && s1[j]==')' || s1[i]=='['&&s1[j]==']')
					dp[i][j]=dp[i+1][j-1]+2;
                for (int kk=i;kk<j;kk++)
					dp[i][j]=max(dp[i][j],dp[i][kk]+dp[kk+1][j]);
			}
		}
		printf("%d\n",dp[0][len-1]);
	}
	//freopen("in","r",stdin);
	//scanf("%d",&T);
	//printf("time=%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}

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