linear DP AcWing 897. Longest common subsequence

Original link

AcWing 897. Longest common subsequence

Algorithm tags

Dynamic programming linear DP

Ideas

Code

#include<bits/stdc++.h>
#define int long long
#define rep(i, a, b) for(int i=a;i<b;++i)
#define Rep(i, a, b) for(int i=a;i>b;--i)
using namespace std;
const int N = 1005, INF = 0x3f3f3f3f;
int n,m;
char A[N], B[N];
int f[N][N];
inline int read(){
   int s=0,w=1;
   char ch=getchar();
   while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
   while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
   return s*w;
}
void put(int x) {
    if(x<0) putchar('-'),x=-x;
    if(x>=10) put(x/10);
    putchar(x%10^48);
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    n=read(), m=read();
    scanf("%s%s", A+1, B+1);
    rep(i, 1, n+1){
        rep(j, 1, m+1){
            f[i][j]=max(f[i-1][j], f[i][j-1]);
            if(A[i]==B[j]){
                f[i][j]=max(f[i][j], f[i-1][j-1]+1);    
            }
        }
    }
    printf("%lld", f[n][m]);
    return 0;
}

Originality is not easy.
Reprint please indicate the source
If it helps you Don't forget to praise and support