HDU 4632 Palindrome subsequence

最新推荐文章于 2021-04-20 23:30:50 发布

dongdongzhang_

最新推荐文章于 2021-04-20 23:30:50 发布

阅读量1.1k

点赞数

分类专栏： DP

本文链接：https://blog.csdn.net/dongdongzhang_/article/details/9706729

版权

DP 专栏收录该内容

23 篇文章 0 订阅

订阅专栏

Palindrome subsequence

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

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 = <S _x1, S _x2, ..., S _xk> and Y = <S _y1, S _y2, ..., S _yk> , if there exist an integer i (1<=i<=k) such that xi != yi, the subsequence X and Y should be consider different even if S _xi = S _yi. 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]的回文串的数量

要自己递推下。

给个表

a a b a c

1 3 4 1011

0 1 2 5 6

0 0 1 2 3

0 0 0 1 2

0 0 0 0 1

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

//

const int V = 1000 + 50;
const int MaxN = 80 + 5;
const int mod = 10000 + 7;
char ch[V];
int T, dp[V][V];
int main() {
    int i, j, c = 1;
    scanf("%d", &T);
    while(T--) {
        scanf("%s", &ch);
        int len = strlen(ch);
        memset(dp, 0, sizeof(dp));
        for(i = 0; i < len; ++i)
            dp[i][i] = 1;
        for(i = 1; i < len; ++i)
            for(j = 0; i + j < len; ++j) {
                if(ch[j] != ch[i + j])
                    dp[j][i + j] = dp[j + 1][i + j] + dp[j][i + j - 1] - dp[j + 1][i + j - 1];
                else
                    dp[j][i + j] = dp[j + 1][i + j] + dp[j][i + j - 1] + 1;
                dp[j][i + j] = (dp[j][i + j] + mod) % mod;
            }
        printf("Case %d: %d\n", c++, dp[0][len - 1]);
    }
}