poj 1114

状态：dp[i][j]表示 i 到 j 最多的匹配个数
转移方程：dp[i][j] = max（dp[i][j], dp[i][k] + dp[k+1][j]);


#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
const int N = 105;
char str[N];
int dp[N][N];
bool judge(char a, char b)
{
    if(a == ‘(‘ && b == ‘)‘) return true;
    if(a == ‘[‘ && b == ‘]‘) return true;
    return false;
}
int main()
{
    while(gets(str) != NULL)
    {
        if(!strcmp(str, "end")) break;
        int len = strlen(str);
        for(int i = 0; i < len; i++)
        {
            dp[i][i] = 0;
            if(judge(str[i], str[i+1]))
                dp[i][i+1] = 2;
            else
                dp[i][i+1] = 0;
        }
        for(int k = 2; k < len; k++) //枚举子串的长度
        {
            for(int i = 0; i + k < len; i++)
            {
                int r = i + k;
                dp[i][r] = 0;
                if(judge(str[i], str[r]))
                    dp[i][r] = dp[i+1][r-1] + 2;
                for(int j = i; j < r; j++)
                    dp[i][r] = max(dp[i][r], dp[i][j] + dp[j+1][r]);
            }
        }
        printf("%d\n",dp[0][len-1]);
    }
    return 0;
}