【HDU】【Number String】

最新推荐文章于 2021-01-27 14:36:21 发布

**：天下第一

最新推荐文章于 2021-01-27 14:36:21 发布

阅读量715

点赞数

分类专栏： ACM_DP

本文链接：https://blog.csdn.net/u013200703/article/details/46884381

版权

ACM_DP 专栏收录该内容

120 篇文章 0 订阅

订阅专栏

Number String

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

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

Recommend

lcy | We have carefully selected several similar problems for you: 4054 4057 4053 4056 4059

#include <iostream>
#include <cstring>
#include <cmath>
#include <queue>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <string>
#include <cstdlib>
#include <cstdio>
#include <algorithm>
using namespace std;

const int maxn = 1010;
const int MOD = 1000000007;	

typedef long long LL;
char str[maxn];
LL dp[maxn][maxn];
LL sum[maxn][maxn];
int main()
{
	freopen("1.txt","r",stdin);
	while(scanf("%s",str+1) != EOF)
	{
		memset(dp,0,sizeof(dp));
		memset(sum,0,sizeof(sum));
		sum[1][0] = 0;
	    sum[1][1] = 1;	
		int len = strlen(str+1) + 1;
		for(int i=2;i<=len;i++)
		{
			for(int j=1;j<=i;j++)
			{
				if(str[i-1] == 'I')
				{
					dp[i][j] = sum[i-1][j-1];
				}
				else if(str[i-1] == 'D')
				{
					dp[i][j] = (sum[i-1][i-1] - sum[i-1][j-1] + MOD) % MOD;
				}
				else
				{
					dp[i][j] = sum[i-1][i-1]; 
				}
				sum[i][j] = (sum[i][j-1] + dp[i][j]) % MOD;  
			}
		}

		printf("%d\n",sum[len][len]);
	}

}