HDU 5791 Two(DP)

Two

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


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

题意：求两个序列的公共子序列个数。可重复，比如A={1，1，1}，B={1，1}答案为6个。

思路：设dp[i][j]表示A序列前i个数和B序列前j个数的相同子序列对有多少个。

#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
using namespace std;

long long dp[1005][1005];
int a[1005],b[1005];
const long long mod = 1000000007;

int main()
{
    int n,m;
    while(cin>>n>>m)
    {
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
        }
        for(int i=1;i<=m;i++)
        {
            scanf("%d",&b[i]);
        }
        memset(dp,0,sizeof(dp));
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                if(a[i]==b[j])
                {
                    dp[i][j]=((dp[i-1][j]+dp[i][j-1])%mod+1)%mod;
                }
                else
                {
                    dp[i][j]=((dp[i-1][j]+dp[i][j-1])%mod-dp[i-1][j-1]+mod)%mod;   //注意这里可能为负数要先+mod再取膜。
                }
            }
        }
        cout<<dp[n][m]<<endl;
    }
    return 0;
}