HDU 5791 dp

Two

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)

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题，状态转移方程跟最长公共子序列很像，先mark下来。

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
typedef long long ll;
const ll mod=1000000007;
ll a[1005],b[1005],dp[1005][1005];
int main(){
    ll n,m;
    while(scanf("%lld%lld",&n,&m)!=EOF){
        for(ll i=1;i<=n;i++)scanf("%lld",&a[i]);
        for(ll i=1;i<=m;i++)scanf("%lld",&b[i]);
        for(ll i=1;i<=n;i++){
            for(ll 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)%mod;//加一个mod防负数
                }
            }
        }
        printf("%lld\n",dp[n][m]);
    }
    return 0;
}