区间DP UVA 11584 Partitioning by Palindromes

题目传送门

 /*
     题意：给一个字符串，划分成尽量少的回文串
     区间DP：状态转移方程：dp[i] = min (dp[i], dp[j-1] + 1); dp[i] 表示前i个字符划分的最少回文串，
             如果s[j] 到 s[i]是回文串，那么可以从dp[j-1] + 1递推过来
 */
 #include <cstdio>
 #include <cstring>
 #include <algorithm>
 #include <cmath>
 using namespace std;

 const int MAXN = 1e3 + ;
 const int INF = 0x3f3f3f3f;
 int dp[MAXN];
 char s[MAXN];

 bool ok(int l, int r)   {
     while (l < r)   {
         if (s[l] != s[r])   return false;
         l++;    r--;
     }
     return true;
 }

 int main(void)  {       //UVA 11584 Partitioning by Palindromes
     int T;  scanf ("%d", &T);
     while (T--) {
         scanf ("%s", s + );
         int len = strlen (s + );
         memset (dp, , sizeof (dp));
         for (int i=; i<=len; ++i)  {
             dp[i] = i;
             for (int j=; j<=i; ++j) {
                 if (ok (j, i))  {
                     dp[i] = min (dp[i], dp[j-] + );
                 }
             }
         }

         printf ("%d\n", dp[len]);
     }

     return ;
 }