poj 2955 Brackets 区间dp

题目：http://poj.org/problem?id=2955

题意：给一串由()[]四个字符组成的字符串，求最大匹配个数

思路：定义dp[i][j]为从i到j的最大匹配个数，当s[i]和s[j]相匹配时，显然有dp[i][j] = dp[i+1][j-1] + 2，然后依次枚举i到j之间的中间值dp[i][j] = max(dp[i][j], dp[i][k] + dp[k+1][j])

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

typedef long long ll;
const int N = 120;

int main()
{
    char s[N];
    int dp[N][N];
    while(scanf(" %s", s), strcmp(s, "end"))
    {
        memset(dp, 0, sizeof dp);
        int len = strlen(s);
        for(int l = 2; l <= len; l++) /*枚举区间长度*/
        {
            for(int i = 0; i <= len - l; i++)/*区间起始位置*/
            {
                int j = i + l - 1; /*区间截止位置*/
                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;
}