HDU 5791 Two ( DP )

Two

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1505    Accepted Submission(s): 661

Problem Description

Alice gets two sequences A and B. A easy problem comes. How many pair of sequence A' and sequence B' are same. For example, {1,2} and {1,2} are same. {1,2,4} and {1,4,2} are not same. A' is a subsequence of A. B' is a subsequence of B. The subsequnce can be not continuous. For example, {1,1,2} has 7 subsequences {1},{1},{2},{1,1},{1,2},{1,2},{1,1,2}. The answer can be very large. Output the answer mod 1000000007.

 

Input

The input contains multiple test cases.

For each test case, the first line cantains two integers N,M(1≤N,M≤1000) . The next line contains N integers. The next line followed M integers. All integers are between 1 and 1000.

 

Output

For each test case, output the answer mod 1000000007.

 

Sample Input

  
  

   
   3 2
1 2 3
2 1
3 2
1 2 3
1 2
  
  

 

Sample Output

  
  

   
   2
3
  
  

 

Author

ZSTU

 

Source

2016 Multi-University Training Contest 5

 

Recommend

wange2014   |   We have carefully selected several similar problems for you:   5803  5802  5801  5800  5799 

 

#include<stdio.h>
#include<string.h>
#include<algorithm>
#define mod 1000000007
using namespace std;
__int64 dp[1100][1100];//保存a[i] b[j]之前相同的所有序列的个数 
__int64 a[1100],b[1100];
int main()
{
	__int64 n,m,i,j;
	while(scanf("%I64d%I64d",&n,&m)!=EOF)
	{
		for(i=1;i<=n;i++)
		scanf("%I64d",&a[i]);
		for(i=1;i<=m;i++)
		scanf("%I64d",&b[i]);
		memset(dp,0,sizeof(dp));
		for(i=1;i<=n;i++)
		for(j=1;j<=m;j++)
		{
			if(a[i]==b[j])
		    dp[i][j]=(dp[i-1][j]+dp[i][j-1]+1)%mod;
			else dp[i][j]=(dp[i-1][j]+dp[i][j-1]-dp[i-1][j-1])%mod;
		}
		printf("%I64d\n",(dp[n][m]+mod)%mod);//因为动态转移方程中存在减法 ，所以这里要处理一下 
	}
	return 0;
}