题意:求两个字符串的最长公共子序列。
思路:动态规划+滚动数组
#include <stdio.h>
#include <string.h>
#define N 1025
int dp[2][N];
char s[N],t[N];
int max(int a,int b){
if(a>b)
return a;
return b;
}
int common_subsequence(){
int i,j,lens,lent;
lens = strlen(s+1);
lent = strlen(t+1);
for(i = 1;i<=lens;i++){
for(j = 1;j<=lent;j++)
if(s[i] == t[j])
dp[1][j] = dp[0][j-1]+1;
else
dp[1][j] = max(dp[0][j],dp[1][j-1]);
for(j = 1;j<=lent;j++)
dp[0][j] = dp[1][j];
}
return dp[1][lent];
}
int main(){
freopen("a.txt","r",stdin);
while(scanf("%s %s",s+1,t+1)!=EOF){
memset(dp,0,sizeof(dp));
printf("%d\n",common_subsequence());
}
return 0;
}