poj2955（区间DP）

地址：http://poj.org/problem?id=2955

Brackets

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 2601		Accepted: 1344

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，状态专题方程：

                  if((bk[i]=='('&&bk[k]==')')||(bk[i]=='['&&bk[k]==']'))
                        dp[i][j]=max(dp[i][j],dp[i+1][k-1]+dp[k+1][j]+2);
                    else dp[i][j]=max(dp[i][j],dp[i][k-1]+dp[k][j]);

代码：

#include<iostream>
#include<queue>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
#define LL __int64
#define Mod 0xfffffff
char bk[110];
int dp[110][110];
int main(){
    while(scanf("%s",bk)>0){
        if(bk[0]=='e') break;
        int len=strlen(bk);
        memset(dp,0,sizeof(dp));
        for(int l=1;l<len;l++){
            for(int i=0;i<len-l;i++){
                int j=i+l;
                for(int k=i+1;k<=j;k++){
                    if((bk[i]=='('&&bk[k]==')')||(bk[i]=='['&&bk[k]==']'))
                        dp[i][j]=max(dp[i][j],dp[i+1][k-1]+dp[k+1][j]+2);
                    else dp[i][j]=max(dp[i][j],dp[i][k-1]+dp[k][j]);
                }
            }
        }
        printf("%d\n",dp[0][len-1]);
    }
    return 0;
}

/*测试数据：
[(((])))   6
[((([])))   8
*/