动态规划—杭电1159 Common Subsequence
来源:互联网 发布:rxtxcomm linux配置 编辑:程序博客网 时间:2024/06/15 20:26
http://acm.hdu.edu.cn/showproblem.php?pid=1159
Common Subsequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9101 Accepted Submission(s): 3681
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.
Sample Input
abcfbc abfcab
programming contest
abcd mnp
Sample Output
4
2
0
辅助空间变化示意图abcf bca111111b122222f122333c123334a123334b123344
#include <iostream>#include <string.h>#define max(a,b) a>b?a:busing namespace std;char a[1001],b[1001];int dp[1001][1001];int main(){while(cin>>a>>b){memset(dp,0,sizeof(dp));int lena,lenb;lena=strlen(a);lenb=strlen(b);int i,j;for(i=0;i<lena;i++)for(j=0;j<lenb;j++){if(a[i]==b[j])dp[i+1][j+1]=dp[i][j]+1;elsedp[i+1][j+1] = max(dp[i+1][j],dp[i][j+1]);}cout<<dp[lena][lenb]<<endl;}return 0;}
0 0
- 动态规划—杭电1159 Common Subsequence
- Common Subsequence 杭电HDU1159 【动态规划LCS】
- 动态规划 Common Subsequence
- 杭电1159—Common Subsequence题解
- 杭电1159-Common Subsequence
- 杭电1159Common Subsequence
- HDU 1159 Common Subsequence (动态规划LCS)
- hdu 1159 Common Subsequence (动态规划)
- hdu 1159 Common Subsequence(动态规划)
- hdu 1159 Common Subsequence 动态规划
- HDU 1159 Common Subsequence(动态规划)
- HDU 1159 Common Subsequence(动态规划)
- 【HDU 1159】Common Subsequence (动态规划)
- 【动态规划】poj1458 common subsequence
- POJ1458 Common Subsequence 动态规划
- Hdu1159 - Common Subsequence - 动态规划
- HDU1159 Common Subsequence(动态规划)
- Common Subsequence 动态规划I
- 分页搜索问题 struts2 s:url
- 懒省事得小明
- android:控件焦点问题 descendantFocusability用法简析
- 讓 Mac OS X HOME/END 鍵生效
- WP8.1新功能全解析
- 动态规划—杭电1159 Common Subsequence
- Linux SPI总线和设备驱动架构之二:SPI通用接口层
- Physical Storage Structures(oracle官方文档整理&翻译)
- AIDL Service,跨进程调用Services
- EXTJS学习二
- 解决WFD不同电视分辨率投射边框显示不全的问题
- 吸血鬼数
- PhotoShop基础笔记(第一,第二天)
- C ++ memset()