HDU 4632 Palindrome subsequence(区间dp)

原创 2015年07月10日 14:26:18

Palindrome subsequence

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


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 <A, B, D> is a subsequence of <A, B, C, D, E, F>.
(http://en.wikipedia.org/wiki/Subsequence)

Given a string S, your task is to find out how many different subsequence of S is palindrome. Note that for any two subsequence X = <Sx1, Sx2, ..., Sxk> and Y = <Sy1, Sy2, ..., Syk> , if there exist an integer i (1<=i<=k) such that xi != yi, the subsequence X and Y should be consider different even if Sxi = Syi. Also two subsequences with different length should be considered different.
 

Input
The first line contains only one integer T (T<=50), which is the number of test cases. Each test case contains a string S, the length of S is not greater than 1000 and only contains lowercase letters.
 

Output
For each test case, output the case number first, then output the number of different subsequence of the given string, the answer should be module 10007.
 

Sample Input
4 a aaaaa goodafternooneveryone welcometoooxxourproblems
 

Sample Output
Case 1: 1 Case 2: 31 Case 3: 421 Case 4: 960
 

Source
 




/*
题意:问一个字符串的会问序列有多少个
    dp[i][j]=(dp[i][j-1]+dp[i+1][j]-dp[i+1][j-1]);
    if(c[i]==c[j]) 那么加上中间的dp[i+1][j-1],因为可以和i,j形成新的
    还要加上  1  (i 和  j 形成字符串)


*/

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<set>
#include<map>

#define L(x) (x<<1)
#define R(x) (x<<1|1)
#define MID(x,y) ((x+y)>>1)

#define bug printf("hihi\n")

#define eps 1e-8
typedef __int64 ll;

using namespace std;

#define mod 10007
#define INF 0x3f3f3f3f
#define N 1005

int dp[N][N];
int len;
char c[N];

int main()
{
   int i,j,t,ca=0;
   scanf("%d",&t);
   while(t--)
   {
       scanf("%s",c);
       len=strlen(c);
       memset(dp,0,sizeof(dp));
       for(i=0;i<len;i++)
          dp[i][i]=1;

       for(i=len-1;i>=0;i--)
         for(j=i+1;j<len;j++)
         {
            dp[i][j]=(dp[i+1][j]+dp[i][j-1]-dp[i+1][j-1]+mod)%mod;
            if(c[i]==c[j])
                dp[i][j]=(dp[i][j]+dp[i+1][j-1]+1+mod)%mod;
         }
         printf("Case %d: %d\n",++ca,(dp[0][len-1]+mod)%mod);
   }
   return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

HDU 4632 Palindrome subsequence (区间DP)

Palindrome subsequence Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65535 K (Java...
  • jncsw
  • jncsw
  • 2016年07月15日 14:21
  • 173

Hdu oj 4632 Palindrome subsequence(区间dp)

Palindrome subsequence Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65535 K (Java...
  • Sara_YF
  • Sara_YF
  • 2016年08月08日 14:12
  • 132

hdu 4632 Palindrome subsequence 区间dp 多校联合训练第四场

注意到任意一个回文子序列收尾两个字符一定是相同的,于是可以区间dp,用dp[i][j]表示原字符串中[i,j]位置中出现的回文子序列的个数,有递推关系: 当 第i个字符与第j个字符不相等时有dp[i]...

HDU 4632 Palindrome subsequence (区间dp 容斥定理)

Palindrome subsequence Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65535 K (Java...

HDU 4632 Palindrome subsequence(区间合并动态规划)

题意:给定T串只含小写字母的字符串,对于每串,输出回文字串的数目模10007 思路:区间合并,对于从第i个字符到第j个字符的串里面           (1)如果str[i]!=str[j],则dp[...
  • blzorro
  • blzorro
  • 2013年08月02日 15:25
  • 390

HDU 4632 Palindrome subsequence 记忆化搜索

Palindrome subsequence Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65535 K (Java/...

Palindrome subsequence(区间dp)

http://acm.hdu.edu.cn/showproblem.php?pid=4632 Palindrome subsequence Time Limit: 2000/1000 MS...

HDOJ 4632 Palindrome subsequence

Palindrome subsequence Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65535 K (Java/...

hdu4632(DP)

Palindrome subsequence Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65535 K (Java/...

Cheapest Palindrome (poj 3280 区间DP)

题意:长度为M的字符串,可以增加或删除字符,使其构成回文,增加或删除不同的字符有不同的花费,求最小花费。 这位大神讲的很详细,看后收获很大~...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU 4632 Palindrome subsequence(区间dp)
举报原因:
原因补充:

(最多只允许输入30个字)