Brackets

 http://poj.org/problem?id=2955

题意：()[]匹配的最长子序列；

总结：区间dp，因为从小区间开始更新，当i，j匹配时dp[i][j]=dp[i+1][j-1]+2；

#include<algorithm>
#include<set>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e6+9;
const int mod=1e9+7;

inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}

int dp[109][109];
string s;
bool ch(int x,int y)
{
    if(s[x]=='('&&s[y]==')') return 1;
    if(s[x]=='['&&s[y]==']') return 1;
    return 0;
}
int main()
{
    FAST_IO;
    //freopen("input.txt","r",stdin);

    while(cin>>s)
    {
        if(s=="end") break;

        s="0"+s;

        int n=s.length();
        for(int i=0;i<=n;i++)
        {
            for(int j=0;j<=n;j++) dp[i][j]=0;
        }

        for(int len=2;len<=n;len++)//区间长度
        {
            for(int i=1;i+len-1<=n;i++)//区间起点
            {
                int j=i+len-1;//区间终点
                if(ch(i,j)) dp[i][j]=dp[i+1][j-1]+2;
                for(int k=i;k<j;k++)//寻找区间中间的点来更新dp值
                {
                    dp[i][j]=max(dp[i][j],dp[i][k]+dp[k+1][j]);
                }
            }
        }

        cout<<dp[1][n]<<endl;
    }

    return 0;
}