HDU 1159 Common Subsequence

题解：裸的LCS

/*LCS*/
#include <iostream>
#include <string>
using namespace std;
int f[1000][1000]={0};
int main()
{string a,b;while(cin>>a>>b){int m,n;n=a.length();m=b.length();memset(f,0,sizeof(f));for (int i=0; i<n; i++)for (int j=0; j<m; j++){if (a[i]==b[j]) f[i+1][j+1]=f[i][j]+1;else (f[i][j+1]>f[i+1][j])?f[i+1][j+1]=f[i][j+1]:f[i+1][j+1]=f[i+1][j];}printf("%d\n",f[n][m]);}return 0;
}

转载于:https://www.cnblogs.com/forever97/p/3529167.html

HDU 1159 Common Subsequence相关推荐

HDU 1159.Common Subsequence【动态规划DP】
Problem Description A subsequence of a given sequence is the given sequence with some elements (poss ...
HDU 1159 Common Subsequence 动态规划
2017-08-06 15:41:04 writer:pprp 刚开始学dp,集训的讲的很难,但是还是得自己看,从简单到难,慢慢来(如果哪里有错误欢迎各位大佬指正) 题意如下: 给两个字符串,找到其中 ...
hdu 1159 Common Subsequence (dp)
点击打开链接题目意思: 简单DP应用.. 给你两个字符串看看有依次有多少字符相同, Dp[i][j]表示str_1的前i个字符与str_2的前J个字符有dp[i][j]个相同的. dp[i][j]= ...
HD 1159 Common Subsequence （最长公共子序列）
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1159 Problem Description A subsequence of a given seq ...
动态规划—最长公共子序列问题 HDU-1159 Common Subsequence
动态规划-最长公共子序列问题 Common Subsequence [ HDU - 1159 ] A subsequence of a given sequence is the given sequ ...
C++longest common subsequence最长公共子序列的实现(附完整源码)
C++longest common subsequence最长公共子序列 longest common subsequence最长公共子序列的完整源码(定义,实现,main函数测试) longest ...
Common Subsequence
原题及翻译 A subsequence of a given sequence is the given sequence with some elements (possible none) lef ...
【算法导论学习-29】动态规划经典问题02：最长公共子序列问题（Longest common subsequence，LCS）...
2019独角兽企业重金招聘Python工程师标准>>> 问题描述:序列X={x1,x2,-,xn},Y={y1,y2,-,yn},当Z={z1,z2-,zn}是X的严格递增下标顺序( ...
UVA10405 Longest Common Subsequence【LCS+DP】
Given two sequences of characters, print the length of the longest common subsequence of both sequen ...

HDU 1159 Common Subsequence

HDU 1159 Common Subsequence相关推荐

最新文章

热门文章