UVA 11584(p275)----Partitioning by Palindromes

#include<iostream>#include<cstdio>#include<algorithm>#include<string>#include<cstring>#define hellusing namespace std;const int maxn=1000+50;int n,t;string st;int d[maxn];int s[maxn][maxn];int check(int l,int r){    while(l<r)    {        if(st[l]!=st[r])            return 0;        l++;r--;        if(l>=n||r<0) break;    }    return 1;}void prepare(){    memset(s,0,sizeof(s));    for(int i=0;i<n;i++)        for(int j=i;j<n;j++)           if(check(i,j)) s[i+1][j+1]=1;}void solve(){    memset(d,0,sizeof(d));    for(int i=1; i<=n; i++)    {        d[i]=i;        for(int j=1; j<=i; j++)        {            if(s[j][i])                d[i]=min(d[i],d[j-1]+1);        }    }    printf("%d\n",d[n]);}int main(){    #ifdef hello     freopen("in.in","r",stdin);    #endif // hello    cin>>t;    for(int i=0; i<t; i++)    {        cin>>st;        n=st.length();        prepare();        solve();    }    return 0;}