[CQOI 2007] 涂色

[题目链接]

https://www.lydsy.com/JudgeOnline/problem.php?id=1260

[算法]

区间DP

[代码]

#include<bits/stdc++.h>
using namespace std;
#define MAXN 55

int i,j,k,t,len;
int f[MAXN][MAXN];
char s[MAXN];

int main()
{

        scanf("%s",s + );
        len = strlen(s + );
        memset(f,0x3f,sizeof(f));
        for (i = ; i <= len; i++) f[i][i] = ;
        for (i = ; i <= len; i++)
        {
                for (j = ; j <= len - i + ; j++)
                {
                        k = j + i - ;
                        if (s[j] == s[k])
                        {
                                f[j][k] = min(f[j + ][k],f[j][k - ]);
                                f[j][k] = min(f[j][k],f[j + ][k - ] + );
                        } else
                        {
                                for (t = j; t < k; t++)
                                        f[j][k] = min(f[j][k],f[j][t] + f[t + ][k]);
                        }
                }
        }
        printf("%d\n",f[][len]);

        return ;

}