UVA11584 - Partitioning by Palindromes - 动态规划

#include<stdio.h>
#include<string.h>
char ch[1005];
int dp[1005];
int min(int a,int b)
{
	return a<b?a:b;
}
int pand(int a,int b)
{
	while(a<b)
	{
		if(ch[a]!=ch[b])
		{
			return 0;
		}
		a++;
		b--;
	}
	return 1;
}
int main()
{
	int n;
	while(scanf("%d",&n)!=EOF)
	{
		scanf("%s",ch);
		int t=strlen(ch);
		memset(dp,0,sizeof(dp));
		for(int i=0;i<t;i++)
		{
			dp[i]=i+1;
			for(int j=0;j<=i;j++)
			{
				if(pand(j,i)==1)
				{
					dp[i]=min(dp[i],dp[j-1]+1);
				}
			}
		}
		printf("%d\n",dp[t-1]);
	}
}