SDU程序设计思维与实践Week12 【POJ2955】Brackets 【区间DP】

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 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[i][j]$表示区间$[i,j]$内最大的匹配数。
• 判断第$i$个数和第$j$个数是不是匹配括号，如果是，那么$dp[i][j]=dp[i+1][j-1]+2$
• 先枚举区间长度len，再枚举左端点i，这样右端点即为$i+len-1$，利用子问题的解来更新答案$dp[i][j]=max(dp[i][j],dp[i][k]+dp[k][j])$

代码

#include<iostream>
#include<algorithm>
#include<string>
#include<cstring>
using namespace std;
string s;
int dp[105][105],n;
int main(){
	while(true){
		cin>>s;
		if(s=="end") break;
		n=s.length();
		memset(dp,0,sizeof dp);
		for(int len=2;len<=n;len++){
			for(int i=0;i<n-len+1;i++){
				int j=i+len-1;
				if(s[i]=='('&&s[j]==')'||s[i]=='['&&s[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]);
				}
			}
		}
		cout<<dp[0][n-1]<<endl;
	}
}