POJ - 1458 Common Subsequence 动态规划

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

思路：

用 dp[i][j] 来存前s1字符串的前i个和s2字符串的前j个有多少个相等的

s1[i] == s2[j]      dp[i+1][j+1] = dp[i][j] + 1;  当前位置二者相等，就等于二者各向前推的一个位置的最优解加一
s1[i] != s2[j]       dp[i+1][j+1] = max(dp[i+1][j], dp[i][j+1]);  当前位置二者不相等时，就取二者其中一个向前推一位的最大值

AC代码

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<queue>
#include<string>
#include<map>
#define INF 0x3f3f3f3f
#define rep(i,a,n) for(int i=a;i<n;i++)
#define per(i,a,n) for(int i=n-1;i>=a;i--)
#define fori(x) for(int i=0;i<x;i++)
#define forj(x) for(int j=0;j<x;j++)
#define memset(x,y) memset(x,y,sizeof(x))
#define memcpy(x,y) memcpy(x,y,sizeof(y))
#define sca(x) scanf("%d", &x)
#define scas(x) scanf("%s",x)
#define scas2(x,y) scanf("%s%s",x,y)
#define sca2(x,y) scanf("%d%d",&x,&y)
#define sca3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define scl(x) scanf("%lld",&x)
#define scl2(x,y) scanf("%lld%lld",&x,&y)
#define scl3(x,y,z) scanf("%lld%lld%lld",&x,&y,&z)
#define pri(x) printf("%d\n",x)
#define pri2(x,y) printf("%d %d\n",x,y)
#define pris(x) printf("%s\n",x)
#define prl(x) printf("%lld\n",x)
//#include <bits/stdc++.h>

typedef long long ll;
const int maxn=1e6+7;
const int mod=1e9+7;
const double eps=1e-8;

using namespace std;

char s1[5000],s2[5000];
int dp[5000][5000];

int main()
{
    while(scas2(s1,s2)!=EOF)
    {
      int len1 = strlen(s1);
      int len2 = strlen(s2);
      rep(i,0,len1)
      {
        rep(j,0,len2)
          dp[i][j] = 0;
      }
      rep(i,0,len1)
      {
        rep(j,0,len2)
        {
          if(s1[i] == s2[j])
            dp[i+1][j+1] = dp[i][j] + 1;
          else
            dp[i+1][j+1] = max(dp[i+1][j], dp[i][j+1]);
        }
      }
      printf("%d\n",dp[len1][len2]);
    }
    return 0;
}