ZOJ 1733 Common Subsequence(LCS)

状态转移方程

#include <iostream>
#include <cstring>
#include <cstdio>
#include <memory.h>
using namespace std;
const int maxn=300;
int dp[maxn][maxn];
char s1[maxn],s2[maxn];
int main(){
	while(scanf("%s %s",s1+1,s2+1)!=EOF){
		memset(dp,0,sizeof(dp));
		int len1=strlen(s1+1),len2=strlen(s2+1);
		for(int i=1;i<=len1;++i){
			for(int j=1;j<=len2;++j){
				if(s1[i]==s2[j]){
					dp[i][j]=dp[i-1][j-1]+1;
				}else{
					if(dp[i-1][j]>=dp[i][j-1]){
						dp[i][j]=dp[i-1][j];
					}else{
						dp[i][j]=dp[i][j-1];
					}
				}
			}
		}
		printf("%d\n",dp[len1][len2]);
	}
	return 0;
}