Two
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1500 Accepted Submission(s): 414
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.
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,dp[i][j]表示从0到i的第一个序列和从0到j的第二个序列的子序列相同的个数。状态转移方程:
dp[i][j] = dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1] + (a[i] == b[j]?dp[i - 1][j - 1] + 1 : 0);
#include <iostream>
#include<string.h>
#include<vector>
#include<queue>
#include<algorithm>
#include<stdio.h>
#include<math.h>
#include<map>
#include<stdlib.h>
#include<time.h>
using namespace std;
typedef long long ll;
ll dp[1010][1010];
const ll mod=1000000007;
int a[1002],b[1002];
int main()
{
int n,m;
while(~scanf("%d%d",&n,&m))
{
memset(dp,0,sizeof(dp));
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
if(n>=m)
{
for(int i=1; i<=n; i++)
scanf("%d",&a[i]);
for(int i=1; i<=m; i++)
scanf("%d",&b[i]);
}
else
{
for(int i=1; i<=n; i++)
scanf("%d",&b[i]);
for(int i=1; i<=m; i++)
scanf("%d",&a[i]);
}
int n1=0,n2=0;
if(n>m)
{
n1=n;
n2=m;
}
else
{
n1=m;
n2=n;
}
for(int i=1; i<=n1; i++)
for(int j=1; j<=n2; j++)
dp[i][j] = (dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1] + (a[i] == b[j]?dp[i - 1][j - 1] + 1 : 0)+mod)%mod;
printf("%I64d\n",dp[n1][n2]);
}
return 0;
}