LightOJ 1044 - Palindrome Partitioning （区间dp）

题意:

$n<=1000长度的字符串, 最少能划分成几个回文子串$

分析:

$区间dp预处理出isPalindrome[l][r]:= s[l \cdots r]是不是回文串$
$dp[i]:= 表示长度为i的串最少能划分成几个回文串$
$转移就是dp[i]=min\{dp[j]+1,isPalindrome[j+1][i]=1\}$

代码:

//
//  Created by TaoSama on 2015-11-13
//  Copyright (c) 2015 TaoSama. All rights reserved.
//
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>

using namespace std;
#define pr(x) cout << #x << " = " << x << "  "
#define prln(x) cout << #x << " = " << x << endl
const int N = 1e5 + 10, INF = 0x3f3f3f3f, MOD = 1e9 + 7;

int n, dp[1005];
char s[1005];
bool isPalindrome[1005][1005];

int main() {
#ifdef LOCAL
    freopen("C:\\Users\\TaoSama\\Desktop\\in.txt", "r", stdin);
//  freopen("C:\\Users\\TaoSama\\Desktop\\out.txt","w",stdout);
#endif
    ios_base::sync_with_stdio(0);

    int t; scanf("%d", &t);
    int kase = 0;
    while(t--) {
        scanf("%s", s + 1);
        n = strlen(s + 1);
        for(int i = 1; i <= n; ++i) isPalindrome[i + 1][i] = isPalindrome[i][i] = true;
        for(int L = 1; L < n; ++L) {
            for(int i = 1; i + L <= n; ++i) {
                int j = i + L;
                if(s[i] == s[j]) isPalindrome[i][j] = isPalindrome[i + 1][j - 1];
                else isPalindrome[i][j] = false;
            }
        }

//      for(int i = 1; i <= n; ++i)
//          for(int j = i; j <= n; ++j)
//              printf("(%d, %d): %d\n", i, j, isPalindrome[i][j]);

        memset(dp, 0x3f, sizeof dp);
        dp[0] = 0;
        for(int i = 1; i <= n; ++i)
            for(int j = 0; j < i; ++j)
                if(isPalindrome[j + 1][i]) dp[i] = min(dp[i], dp[j] + 1);
        printf("Case %d: %d\n", ++kase, dp[n]);
    }
    return 0;
}