UVA 11584 Partitioning by Palindromes

受区间dp思路影响太严重。。。

开始没用记忆化，tle了

#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>#define MAX 1010using namespace std;char s[MAX];int dp[MAX][MAX],L,dp1[MAX][MAX];void init(){gets(s);L=strlen(s);memset(dp,0,sizeof(dp));for(int i=0;i<MAX;i++)dp[i][i]=1;memset(dp1,-1,sizeof(dp1));}int find(int front,int rear){if(dp[front][rear])return 1;if(dp1[front][rear]!=-1)return dp1[front][rear];int minn=rear-front+1;for(int i=front;i<rear;i++){if(dp[front][i]){int temp=1+find(i+1,rear);minn=min(minn,temp);}}return dp1[front][rear]=minn;}void solve(){for(int i=2;i<=L;i++){for(int j=0;j+i-1<L;j++){int t=i+j-1;if(s[j]==s[t]&&(i==2||dp[j+1][t-1]))dp[j][t]=1;}}int ans=find(0,L-1);printf("%d\n",ans);}int main(){int T;scanf("%d",&T);getchar();while(T--){init();solve();}return 0;}