HDU 5791 Two（DP）2016 Multi-University Training Contest 5

最新推荐文章于 2018-08-01 18:24:24 发布

MrBlankIsAwesome

最新推荐文章于 2018-08-01 18:24:24 发布

阅读量298

点赞数

分类专栏： DP

本文链接：https://blog.csdn.net/mrlry/article/details/52105095

版权

DP 专栏收录该内容

53 篇文章 0 订阅

订阅专栏

Two

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

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

#include <cstring>
#include <cstdio>
#include <iostream>
#include <string.h>
#include <algorithm>
using namespace std;
int a[1005],b[1005];
#define mod 1000000007
int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m))
    {
        long long dp[1005][1005];
        memset(dp,0,sizeof(dp));
        for(int i=1;i<=n;i++)
            scanf("%d",&a[i]);
        for(int i=1;i<=m;i++)
            scanf("%d",&b[i]);
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                dp[i][j]=(dp[i-1][j]+dp[i][j-1]-dp[i-1][j-1]+mod)%mod;
                if(a[i]==b[j])
                    dp[i][j]+=dp[i-1][j-1]+1;
                dp[i][j]%=mod;
            }
        }
        printf("%lld\n",dp[n][m]);

    }
}