最长公共子序列（LCS），最长连续公共子序列

 最长上升子序列（LCS）

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 100;
char A[N], B[N];
int dp[N][N];

int main (){
	int n; 
	gets(A + 1);
	gets(B + 1);
	int lenA = strlen(A + 1);
	int lenB = strlen(B + 1);
	for(int i = 0; i <= lenA ;i ++){
		dp[i][0] = 0;
	}
	for(int i = 0; i <= lenB; i++){
		dp[0][i] = 0;
	}
	for(int i = 1; i <= lenA; i++){
		for(int j = 1; j <= lenB; j++){
			if(A[i] == B[j]){
				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[lenA][lenB]);
	return 0;
} 

最长连续公共子序列

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 100;
char A[N], B[N];
int dp[N][N];

int main (){
	int n; 
	gets(A + 1);
	gets(B + 1);
	int lenA = strlen(A + 1);
	int lenB = strlen(B + 1);
	int maxlen = 0;
	memset (dp, 0, sizeof(dp));
	for(int i = 0; i <= lenA ;i ++){
		dp[i][0] = 0;
	}
	for(int i = 0; i <= lenB; i++){
		dp[0][i] = 0;
	}
	for(int i = 1; i <= lenA; i++){
		for(int j = 1; j <= lenB; j++){
			if(A[i] == B[j]){
				dp[i][j] = dp[i - 1][j - 1] + 1;
			}
			if(maxlen < dp[i][j]){
				maxlen = dp[i][j];
			}
		} 
	}
	printf("%d\n", maxlen);
	return 0;
}