zoukankan      html  css  js  c++  java
  • hdu 4055(经典问题)

    总是不能正确的将一个大问题变成子问题,而且又找不到状态转移方程。 直接导致这题想了5个小时最后还是无果。。。

    谨记! 

    Number String

    Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 1136    Accepted Submission(s): 503


    Problem Description
    The signature of a permutation is a string that is computed as follows: for each pair of consecutive elements of the permutation, write down the letter 'I' (increasing) if the second element is greater than the first one, otherwise write down the letter 'D' (decreasing). For example, the signature of the permutation {3,1,2,7,4,6,5} is "DIIDID".

    Your task is as follows: You are given a string describing the signature of many possible permutations, find out how many permutations satisfy this signature.

    Note: For any positive integer n, a permutation of n elements is a sequence of length n that contains each of the integers 1 through n exactly once.
     

    Input
    Each test case consists of a string of 1 to 1000 characters long, containing only the letters 'I', 'D' or '?', representing a permutation signature.

    Each test case occupies exactly one single line, without leading or trailing spaces.

    Proceed to the end of file. The '?' in these strings can be either 'I' or 'D'.
     

    Output
    For each test case, print the number of permutations satisfying the signature on a single line. In case the result is too large, print the remainder modulo 1000000007.
     

    Sample Input
    II ID DI DD ?D ??
     

    Sample Output
    1 2 2 1 3 6
    Hint
    Permutation {1,2,3} has signature "II". Permutations {1,3,2} and {2,3,1} have signature "ID". Permutations {3,1,2} and {2,1,3} have signature "DI". Permutation {3,2,1} has signature "DD". "?D" can be either "ID" or "DD". "??" gives all possible permutations of length 3.
     
    #include <iostream>
    #include <stdio.h>
    #include <string.h>
    using namespace std;
    #define N 1100
    #define MOD 1000000007
    
    char g[N];
    int dp[2][N];
    
    int main()
    {
        while(scanf("%s",g)!=EOF)
        {
            memset(dp,0,sizeof(dp));
            int a=0,b=1;
            int len=strlen(g);
            dp[a][1]=1;
            int ti=0;
            for(int i=2;i<=len+1;i++)
            {
                for(int j=1;j<=i;j++)
                {
                    if(g[ti]=='I')//以j结尾的。 所有情况
                    {
                        dp[b][j] = (dp[b][j]+dp[a][j-1]);
                        if(dp[b][j]>=MOD) dp[b][j]-=MOD;
                        if(dp[b][j]<0) dp[b][j]+=MOD;
                    }
                    else if(g[ti]=='D')
                    {
                        dp[b][j]= (dp[b][j]+dp[a][i-1]-dp[a][j-1]);
                        if(dp[b][j]>=MOD) dp[b][j]-=MOD;
                        if(dp[b][j]<0) dp[b][j]+=MOD;
                    }else
                    {
                        dp[b][j]= (dp[b][j]+dp[a][i-1]);
                        if(dp[b][j]>=MOD) dp[b][j]-=MOD;
                        if(dp[b][j]<0) dp[b][j]+=MOD;
                    }
                }
                swap(a,b);
                for(int j=1;j<=i;j++)
                {
                    dp[b][j]=0;
                    dp[a][j]=(dp[a][j]+dp[a][j-1]);
                    if(dp[a][j]>=MOD) dp[a][j]-=MOD;
                    if(dp[a][j]<0) dp[a][j]+=MOD;
                }
                ti++;
            }
            //for(int i=1;i<=len+1;i++)
            //    ans= (ans+dp[a][i])%MOD;
            printf("%d
    ",(dp[a][len+1]%MOD+MOD)%MOD);
        }
        return 0;
    }

    Author
    HONG, Qize
     

    Source
     

    Recommend
    lcy
     
  • 相关阅读:
    向量、矩阵常用范数
    关于HP M451网络连接的资料
    pyqt程序最小化到系统托盘(未测试)
    博客园美化大集合2020最新!不用担心失效问题!
    添加QQ聊天
    关于加密
    python抓取谷歌学术关键词下文章题目
    如何确定网站可否可爬取
    灵狐浏览器
    利用beautifulsoup进行对标签的二次查找-以打印网易云歌单内容为例
  • 原文地址:https://www.cnblogs.com/chenhuan001/p/3377765.html
Copyright © 2011-2022 走看看