版权声明:这些都是咸鱼Nova最后的挣扎,各位大佬转载请注明出处 https://blog.csdn.net/weixin_40883049/article/details/78877841
LCS模板:
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
char arr[111],brr[111];
while(scanf("%s%s",arr+1,brr+1))
{
int dp[111][111],i,j,len1=strlen(arr+1),len2=strlen(brr+1);
memset(dp,0,sizeof(dp));
for(i=1; i<=len1; i++)
{
for(j=1; j<=len2; j++)
{
if(arr[i]==brr[j])
{
dp[i][j]=dp[i-1][j-1]+1;
crr[k++]=arr[i];
}
else
{
dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
}
}
}
printf("%d\n",dp[len1][len2]);
}
return 0;
}