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;
}


• 本文已收录于以下专栏：

HDU4632：Palindrome subsequence(区间DP)

Problem Description In mathematics, a subsequence is a sequence that can be derived from another seq...
• libin56842
• 2013年08月03日 11:11
• 2092

HDU4632 Palindrome subsequence（区间DP）

• L954688947
• 2016年02月01日 20:26
• 434

hdu4632

/* 分析：     (找规律+递推) && (线段树 || 树状数组)，非区间dp方法。     以后都不准备再贴水题了，不过这题我比赛时想到的方法和解题报告的方法不一样，所以贴下。。。     ...
• Ice_Crazy
• 2013年08月02日 12:49
• 1173

HDU 4632 Palindrome subsequence （区间DP）

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

HDU 4632 - Palindrome subsequence(区间DP)

• u013534690
• 2015年03月31日 20:06
• 367

HDU 4632 Palindrome subsequence(区间dp)

Palindrome subsequence Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65535 K (Java/...
• ChildrenLi
• 2017年07月05日 08:16
• 100

HDU 4632 Palindrome subsequence（区间DP）

Palindrome subsequence Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65535 K (Java...
• Mr_Treeeee
• 2017年11月01日 21:53
• 56

HDU 4632 Palindrome subsequence(区间DP)

HDU 4632 Palindrome subsequence(区间DP)
• Dacc123
• 2016年03月04日 08:14
• 199

HDU 4632 Palindrome subsequence (区间DP)

• u013742332
• 2015年04月01日 19:57
• 354

Hdu oj 4632 Palindrome subsequence（区间dp）

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

举报原因： 您举报文章：HDU 4632 Palindrome subsequence（区间dp） 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)