poj2955（区间dp）

Brackets

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 4468		Accepted: 2372

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_mwhere 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

分析：括号匹配问题，没找到一对括号都把它看成[xxxxxxx]oooooo这种形式，最大匹配数就为xxxxx的匹配数+ooooo的匹配数+2。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
#define ll long long
const double eps = 1e-6;
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const int MOD = 1000000007;

char str[105];
int dp[105][105];

int main ()
{
    while (gets(str))
    {
        if (strcmp(str, "end")==0)
            break;
        int len = strlen(str);
        for (int i=0; i<len; i++)
            for (int j=0; j<len; j++)
            dp[i][j] = 0;
        for (int i=len-1; i>=0; i--)
        {
            for (int j=i+1; j<len; j++)
            {
                dp[i][j] = max(dp[i+1][j], dp[i][j-1]);
                for (int k=i+1; k<=j; k++)
                {
                    if ((str[i]=='('&&str[k]==')')||(str[i]=='['&&str[k]==']'))
                        dp[i][k] = max(dp[i][k], dp[i+1][k-1]+2);
                    dp[i][j] = max(dp[i][j], dp[i][k]+dp[k+1][j]);
                }
                //cout<<i<<" "<<j<<" "<<dp[i][j]<<endl;
            }
        }
        printf ("%d\n",dp[0][len-1]);
    }
    return 0;
}