区间dp之最大括号匹配数

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <string.h>
#include <math.h>
#include <stack>
#include <ctype.h>
using namespace std;
string str;
int n,k;
int dp[105][105];
int main()
{
    while( cin >> str, str != "end")
    {
        memset(dp, 0, sizeof(dp));
        int length = str.size();
        for( int l = 2; l <= length; l++ )
        {
            for( int i = 0; i+l-1 < length; i++)
            {
                int j = i+l-1;
                dp[i][j] = dp[i+1][j];
                for( int k = i+1; k <= j; k++ )
                {
                    if( ( str[i] == '(' && str[k] == ')' ) || ( str[i] == '['
                        && str[k] == ']' ) )
                        dp[i][j] = max(dp[i][j], dp[i+1][k-1] + dp[k+1][j] + 2);
                }
            }
        }
        cout << dp[0][length-1] << endl;
    }
    return 0;
}

状态

f [ i ][ j ]表示str[ i ] ... str[ j ]中的最大括号匹配数

状态转移方程

i<k<=j

如果str [ i ]和 str [ k ]匹配

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

否则

f[ i ][ j ] = f[ i +1 ][ j ]

边界条件

f[ i ][ i ] = 0;