• HDU 4632 Palindrome subsequence (2013多校4 1001 DP)


    Palindrome subsequence

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


    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
     
    Recommend
    zhuyuanchen520
     

     写的递归形式的DP,

    循环写可能会好一些。

    各种卡常熟,要优化

    /*
     *  Author:kuangbin
     *  1001.cpp
     */
    
    #include <stdio.h>
    #include <algorithm>
    #include <string.h>
    #include <iostream>
    #include <map>
    #include <vector>
    #include <queue>
    #include <set>
    #include <string>
    #include <math.h>
    using namespace std;
    const int MOD = 10007;
    int dp[1100][1100];
    int n;
    char str[1100];
    int solve(int l,int r)
    {
        if(l > r)return 0;
        if(l == r)return dp[l][r] = 1;
        if(dp[l][r] != -1)return dp[l][r];
        if(r == l+1)
        {
            if(str[l] == str[r])
                return dp[l][r] = 3;
            else return dp[l][r] = 2;
        }
        dp[l][r] = solve(l+1,r)+solve(l,r-1);
        if(dp[l][r] >= MOD)dp[l][r]-=MOD;
        if(str[l]==str[r])
        {
            dp[l][r] ++;
            if(dp[l][r] >= MOD)dp[l][r]-=MOD;
        }
        else
        {
            dp[l][r] -= solve(l+1,r-1);
            if(dp[l][r]<0)dp[l][r] += MOD;
        }
        return dp[l][r];
    }
    
    int main()
    {
        //freopen("in.txt","r",stdin);
        //freopen("out.txt","w",stdout);
        int T;
        int iCase = 0;
        scanf("%d",&T);
        while(T--)
        {
            iCase++;
            memset(dp,-1,sizeof(dp));
            scanf("%s",str);
            n = strlen(str);
            printf("Case %d: %d
    ",iCase,solve(0,n-1));
        }
        return 0;
    }
  • 相关阅读:
    是否该让开发人员跟客户直接交流 狼人:
    2010年浏览器随HTML5而动 五大产品年终盘点 狼人:
    微软推出HTML5实验室站点及两项原型技术 狼人:
    传IE9 RC版将于1月28日公开发布 狼人:
    Python——基础篇 狼人:
    百万级访问量网站的技术准备工作 狼人:
    容器对象spring(4)_ bean属性 scope:作用域和lazyinit
    组件注册关于VC++6.0中,MSDev89\Gallery 文件夹为空的问题
    注入参数spring入门(7)装配Bean中构造参数的注入
    优惠播客成都传智播客java基础班大优惠
  • 原文地址:https://www.cnblogs.com/kuangbin/p/3230632.html
Copyright © 2020-2023  润新知