Program3_B

我现在做的是第三专题编号为1002的试题，具体内容如下：

Problem B

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 44   Accepted Submission(s) : 16

Problem Description

A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = &lt;x1, x2, ..., xm&gt; another sequence Z = &lt;z1, z2, ..., zk&gt; is a subsequence of X if there exists a strictly increasing sequence &lt;i1, i2, ..., ik&gt; of indices of X such that for all j = 1,2,...,k, xij = zj. For example, Z = &lt;a, b, f, c&gt; is a subsequence of X = &lt;a, b, c, f, b, c&gt; with index sequence &lt;1, 2, 4, 6&gt;. Given two sequences X and Y the problem is to find the length of the maximum-length common subsequence of X and Y. <br>The program input is from a text file. Each data set in the file contains two strings representing the given sequences. The sequences are separated by any number of white spaces. The input data are correct. 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. <br>

 

Sample Input

  
  

   
   abcfbc abfcab
programming contest 
abcd mnp

  
  

 

Sample Output

  
  

   
   4
2
0

  
  

简单题意：

求两个字符串的最长公共子序列

解题思路：

设c[i][j]为字符串a的第i个字符与字符串b的第j个字符为止的最长公共子序列长度，那么有两种情况：

1.当a[i] == b[j]时，c[i][j]应该是前一个状态的最长公共子序列长度 + 1，而前一个状态是c[i - 1][j]呢，还是c[i][j - 1]？两者都不是，因为a[i]与b[j]匹配，a[i]与b[j]必然不能已经匹配过，否则就是同一个字母匹配了多次，这必然是非法的，因此上一个状态应是c[i - 1][j - 1]，即c[i][j] = c[i - 1][j - 1] + 1；

2.当a[i] != b[j]时，上一个状态可能是c[i - 1][j]或c[i][j - 1]，而既然要找最长公共子序列，自然是找最大的一个，即c[i][j] = max(c[i - 1][j], c[i][j - 1])。

#include<stdio.h>

#include<string.h>

int dp[1010][1010],len1,len2;
char s1[1010],s2[1010];

int  max(int a, int b)
{
   return (a>b?a:b);
}

void chase()
{
    int i,j;
    for(i=1;i<=len1;i++)
    {
        for(j=1;j<=len2;j++)
        {
            if(s1[i-1]==s2[j-1])
                dp[i][j]=dp[i-1][j-1]+1;
            else
                dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
        }
    }
}
int main()
{
    while(scanf("%s%s",&s1,s2)!=EOF)
    {
        len1=strlen(s1);
        len2=strlen(s2);
        chase();
        printf("%d\n",dp[len1][len2]);
    }
}