【HDOJ】1726 God’s cutter

简单DP。

 /* 1726 */
 #include <cstdio>
 #include <cstring>
 #include <cstdlib>

 #define MAXN 105
 #define INF 99999

 bool isValid[MAXN][MAXN];
 char s[MAXN];
 int dp[MAXN];

 bool check(int l, int r) {
     int i, j;

     for (i=l, j=r; i<=j; ++i, --j)
         if (s[i] != s[j])
             return false;
     return true;
 }

 int min(int a, int b) {
     return a<b ? a:b;
 }

 int main() {
     int len;
     int i, j, k;

     #ifndef ONLINE_JUDGE
         freopen("data.in", "r", stdin);
     #endif

     while (scanf("%s", s+) != EOF) {
         len = strlen(s+);
         memset(isValid, false, sizeof(isValid));
         for (i=; i<=len; ++i) {
             isValid[i][i] = true;
             for (j=i+; j<=len; ++j)
                 isValid[i][j] = check(i, j);
         }

         dp[] = -;
         for (i=; i<=len; ++i) {
             dp[i] = dp[i-] + ;
             for (j=; j<i; ++j) {
                 if (isValid[j][i] && dp[j-]+<dp[i]) {
                     dp[i] = dp[j-] + ;
                 }
             }
         }
         printf("%d\n", dp[len]);
     }

     return ;
 }