hdu 5791 Two (dp)
来源:互联网 发布:ubantu装arm linux 编辑:程序博客网 时间:2024/05/16 14:32
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)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] 代表第一个串到i,第二个串到j的公共子串和,那么可以得到的是
dp[i][j]=dp[i-1][j]+dp[i][j-1]-dp[i-1]j-1
就是减掉了重复的部分,
如果a[i]!=a[j]
那么 dp[i][j]=dp[i-1][j]+dp[i][j-1]-dp[i-1][j-1]+dp[i-1][j-1]+1;
因为要加上 还没包含i和 j的情况下的所有子序列都可以到达 dp[i][j],再加上自身贡献+1
#include <bits/stdc++.h>using namespace std;const int mod = 1e9+7;typedef long long ll;int a[1100],b[1100];ll dp[1100][1100];int main(){ int n,m; while(~scanf("%d%d",&n,&m)) { 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++) { if(a[i]==b[j]) dp[i][j]=(dp[i-1][j]+dp[i][j-1]+1),dp[i][j]%=mod; else dp[i][j]=(dp[i-1][j]+dp[i][j-1]-dp[i-1][j-1]+mod)%mod; } } printf("%lld\n",dp[n][m] ); }}
- HDU 5791 Two(DP)
- HDU-5791-TWO-DP
- HDU 5791 Two DP
- HDU 5791 Two ( DP )
- hdu 5791 Two dp
- hdu 5791 Two (dp)
- HDU-5791-Two(DP)
- HDU 5791 Two (DP)
- HDU 5791 Two(dp)
- hdu 5791 Two dp(多校)
- hdu 5791 Two n^2 dp
- HDU 5791 Two——DP
- hdu 6170 Two strings dp
- hdu 6170 Two strings(DP)
- HDU 6170(Two strings-DP)
- hdu 6170 Two strings(dp)
- HDU 5791 Two (dp求公共子序列个数)
- HDU 4753 Two Rabbits(区间DP)
- (四)Building a Dynamic UI with Fragments使用fragment构建动态用户界面
- 线性表的应用2
- 谈一谈尾调用优化
- 百度地图的覆盖物自定义(一)--标注物的自定义
- Unity_2D游戏创建工作层_072
- hdu 5791 Two (dp)
- 结合VS,使用码云托管源码
- 暑期项目实训之健康宝APP(二)
- Understanding-LSTMs[中文翻译]
- zookeeper频繁异常问题分析
- 图像复原原理及实现
- 苹果iOS11开发者预览版beta9固件更新发布
- <javaweb> 向外提供json数据接口(登录注册)
- W9Z373416595SS4L9T0