UVA10405 Longest Common Subsequence【LCS+DP】

Given two sequences of characters, print the length of the longest common subsequence of both sequences.
    Sequence 1:

    Sequence 2:

    For example, the longest common subsequence of the following two sequences ‘abcdgh’ ans ‘aedfhr’ is ‘adh’ of length 3.

Input
Input consists of pairs of lines. The first line of a pair contains the first string and the second line contains the second string. Each string is on a separate line and consists of at most 1,000 characters

Output
For each subsequent pair of input lines, output a line containing one integer number which satisfies the criteria stated above.

Sample Input
bcacbcabbaccbab
bccabccbbabacbc
a1b2c3d4e
zz1yy2xx3ww4vv
abcdgh
aedfhr
abcdefghijklmnopqrstuvwxyz
a0b0c0d0e0f0g0h0i0j0k0l0m0n0o0p0q0r0s0t0u0v0w0x0y0z0
abcdefghijklmnzyxwvutsrqpo
opqrstuvwxyzabcdefghijklmn

Sample Output
11
4
3
26
14

问题链接：UVA10405 Longest Common Subsequence
问题描述：（略）
问题分析：
    动态规划问题，是一个标准模板题，套模板就可以了。
    需要注意字符串长度！
程序说明：
    需要注意，要用行读入函数gets()读入数据，不能使用格式化输入"%s%s"，不然会WA。
参考链接：（略）
题记：（略）

AC的C语言程序如下：

/* UVA10405 Longest Common Subsequence */#include <stdio.h>
#include <string.h>#define MAX(x,y) (((x) > (y)) ? (x) : (y))#define N 1000
char a[N + 2], b[N + 2];
int dp[N + 1][N + 1];int lcs(char *p, char *q)
{memset(dp, 0, sizeof(dp));int len1 = strlen(p + 1);int len2 = strlen(q + 1);int i, j;for(i = 1; i <= len1; i++)for(j = 1; j <= len2; j++) {if(p[i] == q[j])dp[i][j] = dp[i - 1][j - 1] + 1;elsedp[i][j] = MAX(dp[i - 1][j], dp[i][j - 1]);}return dp[len1][len2];
}int main(void)
{while(gets(a + 1), gets(b + 1))printf("%d\n", lcs(a, b));return 0;
}

UVA10405 Longest Common Subsequence【LCS+DP】相关推荐

HDU 1159.Common Subsequence【动态规划DP】
Problem Description A subsequence of a given sequence is the given sequence with some elements (poss ...
【算法导论学习-29】动态规划经典问题02：最长公共子序列问题（Longest common subsequence，LCS）...
2019独角兽企业重金招聘Python工程师标准>>> 问题描述:序列X={x1,x2,-,xn},Y={y1,y2,-,yn},当Z={z1,z2-,zn}是X的严格递增下标顺序( ...
CF750E-New Year and Old Subsequence【动态dp】
正题题目链接:https://www.luogu.com.cn/problem/CF750E 题目大意给出一个长度为nnn的数字字符串,qqq次询问给出其的一个子串ttt,询问至少要删除多少个数字 ...
UVA10192 Vacation【LCS+DP+记忆化递归】
You are planning to take some rest and to go out on vacation, but you really don't know which cities ...
最长公共子串LCS (Longest Common Subsequence) 算法
三个方法都有所借鉴,但代码部分是自己试着写出来的,虽然最后的运行结果都是正确的,但此过程中难免会有考虑不周全的地方,如发现代码某些地方有误,欢迎指正.同时有新的想法,也可以提出! 采用顺序结构存储串, ...
LeetCode——1143. 最长公共子序列(Longest Common Subsequence)[中等]——分析及代码（Java）
LeetCode--1143. 最长公共子序列[Longest Common Subsequence][中等]--分析及代码[Java] 一.题目二.分析及代码 1. 动态规划 (1)思路 (2)代 ...
C++longest common subsequence最长公共子序列的实现(附完整源码)
C++longest common subsequence最长公共子序列 longest common subsequence最长公共子序列的完整源码(定义,实现,main函数测试) longest ...
【概率DP】$P2059$ 卡牌游戏
[概率DP]P2059 卡牌游戏链接题目描述 N个人坐成一圈玩游戏.一开始我们把所有玩家按顺时针从1到N编号.首先第一回合是玩家1作为庄家.每个回合庄家都会随机(即按相等的概率)从卡牌堆里选择一张 ...
【数位DP】恨7不成妻
[数位DP]恨7不成妻时间限制: 1 Sec 内存限制: 128 MB 提交: 8 解决: 4 [提交] [状态] [命题人:admin] 题目描述单身! 依然单身! 吉哥依然单身! DS级码 ...

UVA10405 Longest Common Subsequence【LCS+DP】

UVA10405 Longest Common Subsequence【LCS+DP】相关推荐

最新文章

热门文章