【POJ 2955】【经典区间DP 递推写法】 Brackets 【合法括号匹配成功结果+2，求最大结果】

传送门：POJ 2955 Brackets

描述：

Brackets

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 6606		Accepted: 3546

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

Source

Stanford Local 2004

题意：

求出互相匹配的括号的总数

思路：

区间DP，递推写法写起来方便，dp[i][j]存的是i~j区间内匹配的个数

状态转移方程为：

if(s[i]=='('&&s[j]==')'||s[i]=='['&&s[j]==']')
     dp[i][j]=dp[i+1][j-1]+2;
dp[i][j]=max{dp[i][k]+dp[k+1][j]};

代码：

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#define mst(ss,b) memset(ss,b,sizeof(ss));
#define ll __int64
using  namespace std;

char s[105];
int dp[105][105];

int  main(){
  #ifndef ONLINE_JUDGE
  freopen("in.txt","r",stdin);
  #endif	

  while(gets(s)){
  	if(s[0]=='e')break;
  	int len=strlen(s);
  	mst(dp, 0);
  	for(int l=1; l<len; l++){//枚举长度，长度为j-i,所以从1~len-1更新
  		for(int i=0,j=l; j<len; i++,j++){//枚举区间开头结尾
  			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+1][j]);
  		}
  	}
  	printf("%d\n",dp[0][len-1]);
  }
  return 0;
}