poj-2955 括号匹配--简单区间dp

http://poj.org/problem?id=2955

Brackets

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 5970		Accepted: 3183

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

题意：给你一个字符串由'('、')'、'['、']'组成，问此串的括号最大匹配是多少

首先定义dp[i][j]表示第i到第j个括号的最大匹配数，遍历整个串，当ch[i]与ch[j]匹配时，dp[i][j] = dp[i+1][j-1]+2

只需要从小到大枚举所有 i 和 j 中间的括号数目，然后满足匹配就用上面式子dp，然后每次更新dp [ i ] [ j ]为最大值

然后需要更新dp[i][j]的最大值，方法是遍历i到j中的值dp[i][j] = max(dp[i][j], dp[i][s]+dp[s+1][j]);

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
int dp[1100][1100];
int main(){
    int i, j, k;
    string ch;
    while(cin>>ch){
        if(ch=="end")
            break;
        int l = ch.size();
        memset(dp, 0, sizeof(dp));
        for(i=0; i<l; i++){
            for(j=0; j<l; j++){
                dp[i][j] = max()
            }
        }
        for(k=0; k<l; k++){
            for(i=0, j=k; j<l&&i<l; j++, i++){
                if((ch[i]=='('&&ch[j]==')')||(ch[i]=='['&&ch[j]==']'))
                    dp[i][j] = dp[i+1][j-1]+2;
                for(int s=i; s<j; s++)
                    dp[i][j] = max(dp[i][j], dp[i][s]+dp[s+1][j]);
            }
        }
//        for(i=0; i<l; i++){
//            for(j=0; j<l; j++){
//                printf("%d ",dp[i][j]);
//            }
//            printf("\n");
//        }
        cout<<dp[0][l-1]<<endl;
    }
    return 0;
}