POJ - 2955 区间dp

#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<cstdio>
#include<cassert>
#include<iomanip>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define C 0.5772156649
#define pi acos(-1.0)
#define ll long long
#define mod 1000000007
#define ls l,m,rt<<1
#define rs m+1,r,rt<<1|1

using namespace std;

const double g=10.0,eps=1e-7;
const int N=100+10,maxn=60000+10,inf=0x3f3f3f;

int dp[N][N];
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    string s;
    while(cin>>s)
    {
        if(s[0]==‘e‘)break;
        int n=s.size();
        memset(dp,0,sizeof dp);
        for(int len=2;len<=n;len++)//len
        {
            for(int i=0,j=len-1;j<n;i++,j++)//begin
            {
                if((s[i]==‘(‘&&s[j]==‘)‘)||(s[i]==‘[‘&&s[j]==‘]‘))
                    dp[i][j]=dp[i+1][j-1]+2;
                for(int k=i;k<j;k++)
                {
                    dp[i][j]=max(dp[i][j],dp[i][k]+dp[k+1][j]);
                }
            }
        }
        cout<<dp[0][n-1]<<endl;
    }
    return 0;
}
/********************

********************/