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, 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.
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.

Input

abcfbc abfcab
programming contest 
abcd mnp

Output

4
2
0

Sample Input

abcfbc abfcab
programming contest 
abcd mnp

Sample Output

4
2
0

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<algorithm>
#include<stack>
#include<queue>
#include<cctype>
using namespace std;
int dp[10005][10005];
int main()
{
	string s1,s2;
	int len1,len2;
	while(cin>>s1>>s2)
	{
		len1=s1.length();
		len2=s2.length();
		for(int i=0;i<=len1;i++)
		{
			for(int j=0;j<=len2;j++)
			{
				if(i==0||j==0)
				{
					dp[i][j]=0;
					continue;
				}
				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]);
				 } 
			}
		 } 
		 cout << dp[len1][len2] << endl;
	}
	return 0;
}

中文概要：

就是求两个字符串的最长公共子序列，模板题。

最长公共子序列要领：

1. 如果s1[i]==s2[j] 则 c[i][j]=c[i-1][j-1]+1
2. 如果s1[i]!=s2[j] 则 c[i][j]=max(c[i-1][j],c[i][j-1])
3. 这两条简直是精髓，一看就明白了，还有一张图，解释的明明白白的

PS：大晚上的看看榜发现队友们都开始写新开的专题了，就我没开始，吓得我赶紧补补课，开个头，这群队友太可怕了