HDU-1159-Common Subsequence
来源:互联网 发布:二战德国知乎 编辑:程序博客网 时间:2024/06/06 02:43
点击打开链接
Common Subsequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 40701 Accepted Submission(s): 18783
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
题解:最基础的 LIS 求最长公共子序列 。这种基础题直接套模板就行了
#include<stdio.h>#include<string.h>#include<algorithm> using namespace std;int dp[10024][10024]={0};int main(){char str1[10024],str2[10024];while(~scanf("%s%s",str1+1,str2+1))//从第一开始存的,所以加1了{int l1,l2;str1[0]='0';str2[0]='0';l1=strlen(str1)-1;//从一开始存的,字符串长度也-1l2=strlen(str2)-1;for(int i=1;i<=l1;i++)for(int j=1;j<=l2;j++){if(str1[i]==str2[j])dp[i][j]=dp[i-1][j-1]+1;else dp[i][j]=max(dp[i-1][j],dp[i][j-1]);}printf("%d\n",dp[l1][l2]);}return 0; }
阅读全文
0 0
- hdu 1159 Common Subsequence
- HDU 1159 Common Subsequence
- HDU 1159 Common Subsequence
- hdu 1159 Common Subsequence
- HDU 1159 Common Subsequence
- HDU 1159 Common Subsequence
- hdu 1159 Common Subsequence
- hdu 1159 Common Subsequence
- hdu 1159 Common Subsequence
- Common Subsequence hdu 1159
- HDU 1159 Common Subsequence
- HDU 1159 Common Subsequence
- hdu 1159 Common Subsequence
- hdu 1159 Common Subsequence
- HDU 1159 Common Subsequence
- hdu 1159 Common Subsequence
- hdu 1159 Common Subsequence
- hdu 1159 Common Subsequence
- 代码在线自动生成工具,在线生成java代码,springmvc框架,mapper,实体类,控制器,页面代码
- 勾股数
- 深度理解链式前向星
- 【简单学】字体设置
- CF445E:DZY Loves Colors(线段树区间更新)^
- HDU-1159-Common Subsequence
- mysql 注释符号
- iOS日历、日期、时间的计算
- mybait中的log4j配置
- Java版-九大排序算法
- 一个线程安全的计数器实现(java),可以让一个变量每天从1开始递增
- HDU3625 第一类斯特林数
- debian将用户添加到sudoers
- python基础知识