poj1458Common Subsequence(求两个字符串的最长公共子序列)

Common Subsequence
Time Limit: 1000MS   Memory Limit: 10000K
Total Submissions: 44296   Accepted: 18108

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.

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

Source

题目大意:就是求两个字符串的最长公共子序列

代码:

//poj-Common Subsequence(求两个字符串的最长公共子序列)
#include<stdio.h>
#include<string.h>
char str1[1010],str2[1010];
int dp[1010][1010];
int max(int a,int b){
    if(a>b)  return a;
    else     return b;
}
int main()
{
   int len1,len2,i,j;
   while(scanf("%s%s",str1,str2)!=EOF){

     len1=strlen(str1);
     len2=strlen(str2);
     memset(dp,0,sizeof(dp));
     for(i=1;i<=len1;i++)
       for(j=1;j<=len2;j++)
      {
           if(str1[i-1]==str2[j-1])
               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]);
      }
   return 0;
}


阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/bokzmm/article/details/49962745
个人分类: poj
想对作者说点什么? 我来说一句

最长公共子序列求解问题

2009年07月04日 2.28MB 下载

没有更多推荐了,返回首页

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭