携程HDU第一场1002

比赛水了，这是第二题括号匹配水题。经典问题。

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

int N;
int dp[100][100];
char s[101];

#define min(a,b) ((a)>(b)?(b):(a))


int main(void)
{
    int l;
    for(cin >> N; N; --N) {
        cin >> s; l = strlen(s);
        int i, j, k;
        for(j=0; j<l; ++j) dp[j][0] = 1;
        for(j=0; j<l; ++j) {
            dp[j][1] = 0x3f3f3f3f;
            if ((s[j] == '(' && s[j+1] == ')') || (s[j] == '[' && s[j+1] == ']'))
                dp[j][1] = 0;
            else {
                if (s[j] == '(' || s[j] == '[')
                    dp[j][1] = min(dp[j+1][0] + 1, dp[j][1]);
                if (s[j+1] == ')' || s[j+1] == ']')
                    dp[j][1] = min(dp[j][0] + 1, dp[j][1]);
            }
            dp[j][1] = min(dp[j][0] + dp[j+1][0], dp[j][1]);
        }
        for(i=2; i<l; ++i) {
            for(j=0; j<l; ++j) {
                dp[j][i] = 0x3f3f3f3f;
                if ((s[j] == '(' && s[j+i] == ')') || (s[j] == '[' && s[j+i] == ']'))
                    dp[j][i] = min(dp[j+1][i-2], dp[j][i]);
                else {
                    if (s[j] == '(' || s[j] == '[')
                        dp[j][i] = min(dp[j+1][i-1] + 1, dp[j][i]);
                    if (s[j+i] == ')' || s[j+i] == ']')
                        dp[j][i] = min(dp[j][i-1] + 1, dp[j][i]);
                }
                for(k=0; k<i; ++k)
                    dp[j][i] = min(dp[j][k] + dp[j+k+1][i-k-1], dp[j][i]);
            }
        }
        cout << dp[0][l-1] << endl;
    }
    return 0;
}