hdu6212 Zuma(区间dp)

#pragma GCC optimize(2)
#include <bits/stdc++.h>
#define ll long long
#define ls(i)   i<<1
#define rs(i)   i<<1|1
using namespace std;
const int N = +;
char s[N];
int dp[N][N],a[N],n;
int dfs(int i,int j)
{
    if(dp[i][j]>=)
        return dp[i][j];
    if(i==j)
        return dp[i][j]=-a[i];
    dp[i][j]=*n;
    for(int k=i;k<j;k++)
        dp[i][j]=min(dp[i][j],dfs(i,k)+dfs(k+,j));
    if((j-i)%==)
    {
        dp[i][j]=min(dp[i][j],dfs(i+,j-)+(a[i]+a[j]==));
        if(a[i]+a[j]<)
        {
             for(int k=i+;k<j;k+=)
            {
                if(a[k]==)
                {
                    dp[i][j]=min(dp[i][j],dfs(i+,k-)+dfs(k+,j-));
                }
            }
        }

    }
    return dp[i][j];
}
int main(){
    int T;
    cin>>T;
    int kase=;
    while(T--)
    {
        scanf("%s",s+);
        n=strlen(s+);
        int m=;
        for(int i=;i<=n;i++)
        {
            if(s[i]!=s[i-])
                a[++m]=;
            else
                a[m]++;
        }
        memset(dp,-,sizeof(dp));
        printf("Case #%d: %d\n",++kase,dfs(,m));
    }
    return ;
}