POJ2955 区间DP

Brackets

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 6350		Accepted: 3399

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[ i ][ j ]表示从str[ i ]到str[ j ]之间的括号匹配数量。

则 if（str[ i ] 匹配 str[ j ]） dp[ i ][ j ] = dp[ i+1 ][ j-1 ]+2 ；

然后每一次的dp[ i ][ j ]都通过dp[ i ][ x ]+dp[ x ][ j ]找出最大值。

AC代码：

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
char str[105];
int dp[105][105];
int match(char a,char b)
{
    if(a=='('&&b==')')
        return 2;
    else if(a=='['&&b==']')
        return 2;
    return 0;
}
int main()
{
    //freopen("D://in.txt", "r", stdin);
    while(~scanf("%s",str))
    {
        if(strcmp(str,"end")==0)
            break;
        int len=strlen(str);
        memset(dp,0,sizeof(dp));
        for(int k=1;k<len;k++)
        {
            for(int i=0,j=k;j<len;i++,j++)
            {
                dp[i][j]=dp[i+1][j-1]+match(str[i],str[j]);
                for(int x=i;x<j;x++)
                    dp[i][j]=max(dp[i][j],dp[i][x]+dp[x+1][j]);
            }
        }
        printf("%d\n",dp[0][len-1]);
    }
    return 0;
}