hdu 4632

最新推荐文章于 2021-02-09 12:04:24 发布

oopslb

最新推荐文章于 2021-02-09 12:04:24 发布

阅读量280

点赞数

分类专栏：区间dp

本文链接：https://blog.csdn.net/imzxww/article/details/76598763

版权

区间dp 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

Palindrome subsequence

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

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
   
   

   
   思路;这题就是找子串是回文串的种数，数组dp[i][j]记录的是从i到j有多少个回文串，可以推出状态转移方程dp[i][j]=dp[i+1][j]+dp[i][j-1]-dp[i+1][j-1];如果两个字符相等的话，则要再加上dp[i+1][j-1]+1
   
   

   
   代码：
   
   
   
   #include <iostream>
#include <stdio.h>
#include <string.h>
#include <cmath>
#include <queue>
#include <map>
#include <algorithm>
#include <stdlib.h>
using namespace std;
#define ma(a) memset(a,0,sizeof(a))
#define ll long long
const int MOD=10007;
ll dp[1005][1005];
int main()
{
    int T;
    cin>>T;
    char s[1005];
    int ans=1;
    while(T--)
    {
        cin>>s;
        int len=strlen(s);
        int i,j;
        ma(dp);
        for(i=0;i<len;i++)
        {
            dp[i][i]=1;
        }
        for(i=1;i<len;i++)
        {
            for(j=i-1;j>=0;j--)
            {
                dp[j][i]=(dp[j+1][i]+dp[j][i-1]-dp[j+1][i-1]+MOD)%MOD;
                if(s[i]==s[j])
                {
                    dp[j][i]=(dp[j][i]+dp[j+1][i-1]+1+MOD)%MOD;
                }
            }
        }
        printf("Case %d: %d\n",ans++,dp[0][len-1]);
    }
    return 0;
}