HDU Palindrome subsequence(区间DP)

Palindrome subsequence

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65535 K (Java/Others) Total Submission(s): 2836 Accepted Submission(s): 1160

Problem Description In mathematics, a subsequence is a sequence that can be derived from another sequence by deleting some elements without changing the order of the remaining elements. For example, the sequence

//
//  main.cpp
//  区间dp 1001
//
//  Created by 陈永康 on 16/2/28.
//  Copyright © 2016年 陈永康. All rights reserved.
//
#include <iostream>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <algorithm>

using namespace std;
char a[1005];
int dp[1005][1005];
int main()
{
    int t;
    scanf("%d",&t);
    int cas=0;
    while(t--)
    {
        scanf("%s",a+1);
        int len=strlen(a+1);
        memset(dp,0,sizeof(dp));
        for(int i=1;i<=len;i++)
            dp[i][i]=1;
        for(int l=1;l<len;l++)
        {
            for(int i=1;i+l<=len;i++)
            {
                int j=i+l;

                dp[i][j]=(dp[i+1][j]+dp[i][j-1]-dp[i+1][j-1]+10007)%10007;
                if(a[i]==a[j])
                    dp[i][j]=(dp[i][j]+dp[i+1][j-1]+1+10007)%10007;
                //dp[i][j]%=10007;
            }
        }
        printf("Case %d: %d\n",++cas,dp[1][len]);
    }
    return 0;
}

求一个字符串数组的回文子串的数量 dp[i][j]区间i到j的回文子串数量,dp[i][j]=dp[i+1][j]+dp[i][j-1]-d[i+1][j-1],dp[i+1][j-1]是重复的部分这是a[i]不等于a[j]的情况,若二者相等,在这个基础上还要加上dp[i+1][j-1]+1。

本文参与腾讯云自媒体分享计划,欢迎正在阅读的你也加入,一起分享。

发表于

我来说两句

0 条评论
登录 后参与评论

相关文章

来自专栏小樱的经验随笔

HDU 2289 Cup【高精度,二分】

Cup Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/...

2475
来自专栏小樱的经验随笔

HDU 1039 Easier Done Than Said?

Easier Done Than Said? Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 6...

2816
来自专栏ml

HDUOJ------1711Number Sequence

Number Sequence Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/3...

3026
来自专栏算法修养

HDU-1003 Max Sum(动态规划,最长字段和问题)

Max Sum Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (J...

5655
来自专栏算法修养

POJ 2609 Ferry Loading(双塔DP)

Ferry Loading Time Limit: 1000MS Memory Limit: 65536K Total Submissions...

3576
来自专栏算法修养

HDU 3388 Coprime(容斥原理+二分)

Coprime Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (...

3325
来自专栏HansBug's Lab

3212: Pku3468 A Simple Problem with Integers

3212: Pku3468 A Simple Problem with Integers Time Limit: 1 Sec  Memory Limit: 12...

3278
来自专栏ml

hdu 4315 Climbing the Hill(阶梯博弈转nim博弈)

Climbing the Hill Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/...

35811
来自专栏算法修养

HDU 3367 Pseudoforest(Kruskal)

Pseudoforest Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/655...

3015
来自专栏算法修养

HDU-1520 Anniversary party(树形DP)

Anniversary party Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/...

2874

扫码关注云+社区

领取腾讯云代金券