hdu 4055 Number String ( DP 绝对位置转化为相对位置 )

Number String

Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 1013    Accepted Submission(s): 438

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.

   
   
   
    
  
  

 

Author

HONG, Qize

 

Source

2011 Asia Dalian Regional Contest

思路：

DP，将绝对位置转化为相对位置。

状态：dp[i][j]-排列个数   i-长度为i字符串  j-最后一个数的相对位置为j   

从i-1到i时插入一个相对位置为j的数时，将i-1时的数的相对位置>=j的相对位置都加1处理。

方程：

'I'：    dp[i][j]=∑dp[i-1][k]  (1<=k<j )

'D':     dp[i][j]=∑dp[i-1][k]  ( j<=k<i )

'?':      dp[i][j]=∑dp[i-1][k]  (1<=k<i)

ps：对k就不用再套个循环了，用前缀和优化就够了。

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#define maxn 1005
#define INF 0x3f3f3f3f
#define mod 1000000007
using namespace std;

typedef long long ll;
ll ans;
ll dp[maxn][maxn],sum[maxn][maxn];
char s[maxn];

void solve()
{
    int i,j,k,len;
    len=strlen(s);
    for(i=1;i<len;i++)
    {
        sum[i][0]=0;
    }
    dp[1][1]=sum[1][1]=1;
    for(i=2;i<len;i++)
    {
        for(j=1;j<=i;j++)
        {
            if(s[i]=='I') dp[i][j]=sum[i-1][j-1];
            else if(s[i]=='D') dp[i][j]=(sum[i-1][i-1]-sum[i-1][j-1]+mod)%mod; // 注意sum[i-1][i-1]-sum[i-1][j-1]可能为负数 带模的运算可能把大的变小了
            else dp[i][j]=sum[i-1][i-1];
            sum[i][j]=(sum[i][j-1]+dp[i][j])%mod;
        }
    }
    ans=sum[len-1][len-1];
}
int main()
{
    int i,j;
    while(~scanf("%s",s+2))
    {
        s[0]=s[1]=' ';
        solve();
        printf("%I64d\n",ans);
    }
    return 0;
}