POJ - 2955 Brackets(区间dp,括号匹配)

Brackets

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 10369		Accepted: 5517

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

思路:经典括号匹配问题,区间dp：小区间推大区间,枚举区间大小，然后枚举起点。

若s[i]与s[j]括号匹配,则dp[i][j] = dp[i+1][j-1]+2,然后枚举i到j区间内的每个点,更新dp[i][j] = max(dp[i][j],dp[i][x]+dp[x+1][j]).

争取使dp[i][j]变得更大！

代码：

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<queue>
#include<stack>
#include<cstring>
#include<string>
#include<vector>
#include<cmath> 
#include<map>
#define mem(a,b) memset(a,b,sizeof(a))
#define mod 1000000007
using namespace std;
typedef long long ll;
const int maxn = 1e6+5;
const double esp = 1e-7;
const int ff = 0x3f3f3f3f;

char s[520];
int dp[120][120];

int main()
{
	while(~scanf(" %s",s)&&strcmp(s,"end")!= 0)
	{
		mem(dp,0);
		int len = strlen(s);
		
		for(int k = 1;k< len;k++)
		{
			for(int i = 0,j = k;j< len;i++,j++)
			{
				if(s[i] == '('&&s[j] == ')'||s[i] == '['&&s[j] == ']')
					dp[i][j] = dp[i+1][j-1]+2;
				
				for(int x = i;x< j;x++)
					dp[i][j] = max(dp[i][j],dp[i][x]+dp[x+1][j]);
			}
		 }
		cout<<dp[0][len-1]<<endl;
	}
	return 0;
 }