HDU1159poj1458Common Subsequence最长公共子序列

Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 48579 Accepted: 20025

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, x ij = 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.

Input

The program input is from the std input. Each data set in the input contains two strings representing the given sequences. The sequences are separated by any number of white spaces. The input data are correct.

Output

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
 
 
 
 
两字符串逐个字符判断比较,分为相等和不相等两种情况,若相等,则为(i - 1)(j - 1) + 1,前一个s1字符和前一个s2字符比较结果 + 1即可,若不等,则要判断s1前一个元素s2当前元素的最大序列值与s2前一个元素s1当前元素的最大序列值哪一个较大,取大的值
 
 
#include 
    
    
     
     
#include 
     
     
      
      
#include 
      
      
       
       
#include 
       
       
        
        
#include 
        
        
          #define maxn 1000 char s1[maxn]; char s2[maxn]; char c; int dp[maxn][maxn]; using namespace std; int main() { //freopen("in.txt", "r", stdin); while(~scanf("%s%s", s1, s2)) { memset(dp, 0, sizeof(dp)); int n = strlen(s1); int m = strlen(s2); for(int i = 0; i < n; i++) { for(int j = 0; j < m; j++) { if(s1[i] == s2[j]) { dp[i + 1][j + 1] = dp[i][j] + 1; } else { dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j]); } } } printf("%d\n", dp[n][m]); } return 0; } 
        
       
       
      
      
     
     
    
    
第一个例子的图=.=字丑=.=
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值