划分成回文串 (Oartitioning by Palindromes,UVa 11584)

#include <iostream>
#include <string.h>
#include <string>
#include <fstream>
#include <algorithm>
#include <stdio.h>
#include <vector>
#include <queue>
#include <set>
#include <cmath>
using namespace std;
const double eps = 1e-8;
const int INF=0x7fffffff;
#define MAXN 1002
string s;
int ans[MAXN];
int find(int cur)
{
    for(int i=cur-1;i>=0;i--)
    if(s[i]==s[cur])return i;
    return cur;
}
bool check(int a,int b)
{
   // cout<<s.substr(a,b-a+1)<<endl;
   a--;b--;
    if(a==b)return false;
    while(a<b)
    {
        if(s[a]==s[b]){a++;b--;}
        else return false;
    }
    return true;
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        cin>>s;
        int len=s.length();
        ans[0]=0;
        for(int i=1;i<=len;i++)
        {
            ans[i]=INF;
            for(int j=1;j<=i;j++)
            if(check(j,i))ans[i]=min(ans[i],ans[j-1]+1);
            else ans[i]=min(ans[i],ans[j-1]+i-j+1);
           // cout<<ans[i]<<endl;
        }
        printf("%d
",ans[len]);
    }
    return 0;
}

ans[i]=min(ans[i], j到i 是回文串 ans[j-1]+1 ，j到i不是回文串 ans[j-1]+i-j+1)