POJ-2955（DP）

一开始想的状态方程二维的：f[i][j] = max(f[i][j-1], f[i+1][j]), if s[i] matches s[j], then f[i][j] = max(f[i][j], 2 + f[i+1][j-1]);虽然能过sample，但还是WA了，于是自己也造了几个例子，发现过不了")([)"，答案一眼就能看出是2，但是安照这个状态方程，答案却是0，才恍然大悟状态方程应该是三维的：

f[i][j] = (isMatching(s[i], s[j]) ? 2 : 0) + f[i+1][j-1];

f[i][j] = max(f[i][j], max(max(f[i][k], f[k][j]), f[i][k] + f[k+1][j]));

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define isMatching(l, r) (l == '(' && r == ')' || l == '[' && r == ']')

int f[100][100];
int dp(const char* s)
{
    int len = strlen(s);
    if(len < 2) return 0;
//initialize
    memset(f, 0, sizeof(f));
    int i, j, k, l;
    for(i = 1; i < len; ++i) f[i-1][i] = isMatching(s[i-1], s[i]) ? 2 : 0;
//DP
    for(l = 3; l <= len; ++l){
        for(i = 0; (j = i + l - 1) < len; ++i){
            f[i][j] = (isMatching(s[i], s[j]) ? 2 : 0) + f[i+1][j-1];
            for(k = i + 1; k < j; ++k){
                f[i][j] = max(f[i][j], max(f[i][k], f[k][j]));
                f[i][j] = max(f[i][j], f[i][k] + f[k+1][j]);
            }
        }
    }
    return f[0][len-1];
}

char s[101];
int main()
{
    while(strcmp(gets(s), "end")) printf("%d\n", dp(s));
    return 0;
}