本文共 814 字，大约阅读时间需要 2 分钟。
最长公共子序列。
#pragma comment(linker, "/STACK:1024000000,1024000000")#include #include #include #include #include #include #include #include #include #include using namespace std;typedef long long LL;const double pi=acos(-1.0),eps=1e-8;void File(){ freopen("D:\\in.txt","r",stdin); freopen("D:\\out.txt","w",stdout);}inline int read(){ char c = getchar(); while(!isdigit(c)) c = getchar(); int x = 0; while(isdigit(c)) { x = x * 10 + c - '0'; c = getchar(); } return x;}const int maxn=1000;char s[maxn],t[maxn];int dp[maxn][maxn];int main(){ while(~scanf("%s%s",s,t)) { memset(dp,0,sizeof dp); int lens=strlen(s),lent=strlen(t),ans=0; for(int i=0;i
转载于:https://www.cnblogs.com/zufezzt/p/5740732.html