DP 1002

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 abfcabprogramming contest abcd mnp

 

Sample Output

42
0
简单题意：根据X求Y的最长上升子序列
解题思路：
不难发现
当a[i-1]==b[j-1] f[i][j]=f[i-1][j-1]+1;否则f[i][j]=max(f[i-1][j],f[i][j-1]);
AC代码：
#include<iostream>#include<string>#include<algorithm>using namespace std;const int N =1001;int f[N][N];int main(){    string a,b;    int i,j ;    while(cin >> a >> b){        int x = a.length();        int y = b.length();        for(i = 0;i <= x;i ++)            f[i][0] = 0;        for(i = 0;i <= y;i ++)            f[0][i] = 0;        for(i=1;i<=x;i++)        for(j=1;j<=y;j++)        {if(a[i-1]==b[j-1])            f[i][j]=f[i-1][j-1]+1;            else                f[i][j]=max(f[i-1][j],f[i][j-1]);        }        printf("%d\n",f[x][y]);    }    return 0;}