POJ - 2955 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 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.

题意：给出一字符串，求最多的括号匹配个数。

题解：在处理区间[l,r]的时候，如果s[l]与s[r]相匹配，那么dp[l][r]=dp[l+1][r-1]+2;

然后再枚举区间[l,r]的每个断点kdp[l][r]=max(dp[l][r],dp[l][k],dp[k+1][r])

#include <iostream>
#include <cstdio>
#include <cstring> 
using namespace std;
typedef long long ll;
#define INF 0x3f3f3f3f
#define PI acos(-1)
const int N = 1e5+10;
const int mod=1e9+7;
char s[110];
int dp[110][110];
int main() {
	
	while(~scanf("%s",s+1))
	{
		if(!strcmp(s+1,"end")) break;
		memset(dp,0,sizeof(dp));
		int le=strlen(s+1);
		for(int len=2;len<=le;len++)
		{
			for(int l=1;l+len-1<=le;l++)
			{
				int r=l+len-1;
				if(s[l]=='['&&s[r]==']' || s[l]=='('&&s[r]==')')
					dp[l][r]=dp[l+1][r-1]+2;
				for(int k=l;k<r;k++)
				dp[l][r]=max(dp[l][k]+dp[k+1][r],dp[l][r]);
			}
		}
		cout<<dp[1][le]<<endl;
	}
	return 0;
}