http://acm.hdu.edu.cn/showproblem.php?pid=4632
Palindrome subsequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65535 K (Java/Others)
Total Submission(s): 424 Accepted Submission(s): 142
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
2013 Multi-University Training Contest 4
Recommend
zhuyuanchen520
解析:
题意:给出一个字符串,计算子集中含有多少个回文字串序列
思路:
区间DP,dp[i][j]表示[i,j]区间上含有的回文串序列个数
由于单个字母可以看做一个回文串,所以dp[i][i]=1;
除此之外,回文至少由左右两个字符组成
故:dp[i][j]=dp[i+1][j]+dp[i][j-1]-dp[i+1][j-1];减去重复部分
当s[i]==s[j],此时dp[i][j]+=dp[i+1][j-1]+1;
328MS 4280K 669 B
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<algorithm>
#include<iostream>
using namespace std;
const int maxn=1000+10;
const int mod=10007;
char s[maxn];
int dp[maxn][maxn];
int main()
{
int i,len,T,j,c=0;
scanf("%d",&T);
while(T--)
{
scanf("%s",s);
len=strlen(s);
memset(dp,0,sizeof(dp));
for(i=0;i<len;i++)
dp[i][i]=1;
for(j=0;j<len;j++)
for(i=j-1;i>=0;i--)
{
dp[i][j]=(dp[i+1][j]+dp[i][j-1]-dp[i+1][j-1]+mod)%mod;
if(s[i]==s[j])
dp[i][j]=(dp[i][j]+dp[i+1][j-1]+1)%mod;
}
printf("Case %d: %d\n",++c,dp[0][len-1]%mod);
}
//system("pause");
return 0;
}