Common Subsequence HDU dp
来源:互联网 发布:人工智能狂潮 编辑:程序博客网 时间:2024/05/18 10:18
http://acm.hdu.edu.cn/webcontest/contest_showproblem.php?pid=1010&ojid=0&cid=3967
Common Subsequence
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 11 Accepted Submission(s) : 6
Problem Description
A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = <x1, x2, ..., xm> another sequence Z = <z1, z2, ..., zk> is a subsequence of X if there exists a strictly increasing sequence <i1, i2, ..., ik> of indices of X such that for all j = 1,2,...,k, xij = zj. For example, Z = <a, b, f, c> is a subsequence of X = <a, b, c, f, b, c> with index sequence <1, 2, 4, 6>. Given two sequences X and Y the problem is to find the length of the maximum-length common subsequence of X and Y.
The program input is from a text file. Each data set in the file contains two strings representing the given sequences. The sequences are separated by any number of white spaces. The input data are correct. For each set of data the program prints on the standard output the length of the maximum-length common subsequence from the beginning of a separate line.
The program input is from a text file. Each data set in the file contains two strings representing the given sequences. The sequences are separated by any number of white spaces. The input data are correct. For each set of data the program prints on the standard output the length of the maximum-length common subsequence from the beginning of a separate line.
Sample Input
abcfbc abfcabprogramming contest abcd mnp
Sample Output
420
#include<cstdio>#include<cstring>using namespace std;int dp[1001][1001];int main(){ char pre[1001]; char pos[1001]; while(scanf("%s%s",pre,pos)!=EOF) { memset(dp,0,sizeof(dp)); int l1=strlen(pre); int l2=strlen(pos); for(int i=0; i<l1; i++) { for(int j=0; j<l2; j++) { if(pre[i]==pos[j]) dp[i+1][j+1]=dp[i][j]+1; else if(dp[i+1][j]>dp[i][j+1]) dp[i+1][j+1]=dp[i+1][j]; else dp[i+1][j+1]=dp[i][j+1]; } } printf("%d\n",dp[l1][l2]); } return 0;}
- Common Subsequence HDU dp
- hdu 1159 Common Subsequence #DP
- hdu 1159 Common Subsequence (dp)
- HDU--1159 -- Common Subsequence [DP]
- hdu 1159 Common Subsequence(dp)
- HDU Common Subsequence (dp)
- HDU 1159 Common Subsequence (dp)
- Common Subsequence(dp)HDU 1159
- HDU 1159 Common Subsequence(还是DP)
- hdu 题目1159 Common Subsequence(DP)
- HDU 1159 Common Subsequence(DP,LCS)
- hdu 1159 Common Subsequence(LCS,dp)
- HDU 1159 Common Subsequence(dp LCS)
- HDU 1159 Common Subsequence (备忘录DP)
- hdu 1159 Common Subsequence(dp)
- hdu 1159 Common Subsequence (dp)
- Hdu oj 1159 Common Subsequence(dp)
- HDU 1423 Greatest Common Increasing Subsequence(DP)
- NDK开发
- 删除文件时排除特定文件
- 黑马程序员——java中的 GUI
- c# 引用类型和值类型区别 (摘)
- C++防止类被继承
- Common Subsequence HDU dp
- 求解背包问题
- WCF基础知识
- Oracle中的NVL,NVL2,NULLIF以及COALESCE
- 优秀程序员的10种特质
- Oracle 游标基础
- No space left on device 原因总结
- unicode, utf-8, codepage的含义 以及 相互关系
- 数字IO