【HDOJ】1513 Palindrome

DP，MLE后改为滚动数组AC。

 #include <cstdio>
 #include <cstring>
 #include <cstdlib>

 #define MAXN 5001
 #define INF 0x3f3f3f3f
 char str[MAXN];
 short dp[][MAXN];

 int getmin(int x, int y) {
     return x<y ? x:y;
 }

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

     while (scanf("%d", &n) != EOF) {
         scanf("%s", str+);
         memset(dp, , sizeof(dp));
         for (i=n; i>; --i) {
             k = i&;
             for (j=i+; j<=n; ++j) {
                 if (str[i] == str[j]) {
                     dp[k][j] = dp[!k][j-];
                 } else {
                     dp[k][j] = getmin(dp[!k][j], dp[k][j-]) + ;
                 }
             }
         }
         printf("%d\n", dp[][n]);
     }

     return ;
 }