two

two

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

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
  
  
  
  

   
   题意：dp[i][j]表示A序列前i个数和B序列前j个数的相同子序列对有多少个，找公共子序列的个数。复杂度
   
   O(n2)O(n^2)O(n​2​​)
  
  
  
  

   
   
两个序列公共子序列的个数：用的dp
#include<stdio.h>
#include<cstring>
#include<iostream>
using namespace std;
int a[10000],b[10000];
int dp[10000];
long long int ans[3000][3000];
#define mod 1000000007
int main()
{
    int n,m;
    while(scanf("%d%d",&n,&m)!=-1)
    {
        for(int i=1; i<=n; i++)
            scanf("%d",&a[i]);
        for(int i=1; i<=m; i++)
            scanf("%d",&b[i]);
        ans[0][0]=ans[1][0]=ans[0][1]=0;
        for(int i=1; i<=n; i++)
        {
            for(int j=1;j<=m; j++)
            {
                if(a[i]==b[j])
                {
                   ans[i][j]=(ans[i-1][j]+ans[i][j-1]+1)%mod;//防止为负数
                }
                else
                {
                    ans[i][j]=(ans[i-1][j]+ans[i][j-1]-ans[i-1][j-1]+mod)%mod;
                }
            }
        }
        printf("%lld\n",ans[n][m]);
    }
}