经典的区间DP模型--最大括号匹配数。如果找到一对匹配的括号[xxx]oooo,就把区间分成两部分,一部分是xxx,一部分是ooo,然后以此递归直到区间长度为1或者为2.
状态转移方程: dp[i][j] = min(dp[i+1][j],dp[i+1][k-1]+dp[k+1][j]+1)(i<=k<=j&&i和k是一对括号)
AC代码如下:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
using namespace std;
int dp[200][200];
int main(){
string s;
while( cin >> s ){
if( s == "end" ){
break;
}
if( s == "" ){
cout << 0 << endl;
continue;
}
memset( dp, 0, sizeof( dp ) );
for( int i = s.size() - 1; i >= 0; i-- ){
for( int j = i + 1; j < s.size(); j++ ){
dp[i][j] = max( dp[i][j], dp[i+1][j] );
for( int k = i + 1; k <= j; k ++ ){
if( ( s[i] == '[' && s[k] == ']' ) || ( s[i] == '<' && s[k] == '>' ) || ( s[i] == '(' && s[k] == ')' ) ){
dp[i][j] = max( dp[i][j], dp[i+1][k-1] + dp[k+1][j] + 1 );
}
}
}
}
cout << dp[0][s.size()-1] * 2 << endl;
}
return 0;
}