首页 > 代码库 > 【uva-11584】Partitioning by Palindromes(dp)

【uva-11584】Partitioning by Palindromes(dp)

 粗略的复杂度是L^3,长度最大是1000,,没敢做,之后发现其实这个复杂度的系数也不大,可以过,而且很快。

dp[j] = dp[i - 1] + 1 (if(str[i] ~ str[j]为回文)

1432745111584Partitioning by PalindromesAcceptedC++0.0522014-10-09 09:33:17
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<vector>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> pill;
const int maxn = 1111;
char str[maxn];
int   dp[maxn];
bool is_part(int i,int j){
    while(i < j){
        if(str[i] != str[j])
            return false;
        i ++;
        j --;
    }
    return true;
}
int main(){
    int T;
    scanf("%d",&T);
    while(T--){
        scanf("%s",str);
        int L = strlen(str);
        for(int i = 0 ; i <= L; i ++) dp[i] = i + 1;
        for(int j = 0 ; j < L; j ++) // L
            for(int i = 0 ; i <= j ; i ++){ // L
                if(is_part(i,j)){ // L
                    if(i - 1 >= 0)
                        dp[j] = min(dp[j],dp[i - 1] + 1);
                    else
                        dp[j] = 1;
                }
            }
        printf("%d\n",dp[L - 1]);
    }
    return 0;
}

【uva-11584】Partitioning by Palindromes(dp)