poj 1458 Common Subsequence(LCS模板题)
2018-03-28 16:55
423 查看
题目:点击打开链接
题意:
显然是一道LCS
dp[i][j]表示S1序列的前i个和S2序列的前j个的最长公共序列。
dp[i][j]=dp[i-1][j-1]+1 (s1[i]==s2[j])
dp[i][j]=max(dp[i-1][j],dp[i][j-1]) (s1[i]!=s2[j])#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
char s1[1000],s2[1000];
int dp[1000][1000];
int main(){
while (scanf("%s %s",s1+1,s2+1)!=EOF){
memset(dp,0,sizeof(dp));
int len1 = strlen(s1+1);
int len2 = strlen(s2+1);
for (int i = 1;i<=len1;i++)
for (int j = 1;j<=len2;j++){
if (s1[i] == s2[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[len1][len2]);
}
}
题意:
显然是一道LCS
dp[i][j]表示S1序列的前i个和S2序列的前j个的最长公共序列。
dp[i][j]=dp[i-1][j-1]+1 (s1[i]==s2[j])
dp[i][j]=max(dp[i-1][j],dp[i][j-1]) (s1[i]!=s2[j])#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
char s1[1000],s2[1000];
int dp[1000][1000];
int main(){
while (scanf("%s %s",s1+1,s2+1)!=EOF){
memset(dp,0,sizeof(dp));
int len1 = strlen(s1+1);
int len2 = strlen(s2+1);
for (int i = 1;i<=len1;i++)
for (int j = 1;j<=len2;j++){
if (s1[i] == s2[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[len1][len2]);
}
}
相关文章推荐
- POJ-1458 Common Subsequence 【LCS模板】
- poj 1458 Common Subsequence --- LCS模板
- poj 1458 Common Subsequence(lcs模板)
- HDU1159 && POJ1458 Common Subsequence (LCS)
- poj 1458 Common Subsequence(lcs)
- poj 1458 Common Subsequence (LCS模版题)
- POJ 1458 Common Subsequence(最长公共子序列LCS)
- poj 1458 Common Subsequence(LCS)
- poj 1458 Common Subsequence【LCS】
- POJ 1458-Common Subsequence(线性dp/LCS)
- POJ1458 Common Subsequence LCS问题入门题[DP]
- poj 1458 Common Subsequence(LCS)
- POJ 1458 Common Subsequence——LCS
- POJ1458 Common Subsequence LCS问题入门题[DP]
- POJ:1458 Common Subsequence(LCS)
- poj 1458 Common Subsequence【LCS】
- poj - 1458 - Common Subsequence(LCS)
- poj-1458 Common Subsequence(求最长公共子串模板)
- POJ 1458-Common Subsequence(线性dp/LCS)
- POJ 1458 / HDU 1159 / Southeastern Europe 2003 Common Subsequence (DP&LCS)