Cod sursa(job #3309059)

Utilizator Caleb_007Sighiartau Achim Caleb Caleb_007 Data 31 august 2025 16:39:43
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.45 kb
//#include <iostream>
#include <fstream>
using namespace std;
ifstream cin("cmlsc.in");
ofstream cout("cmlsc.out");
int n,m,A[1030],B[1030];
int P(int i, int j)
{
    if(i<=n && j<=m)
    {
        if(A[i]==B[j]) return 1+P(i+1,j+1);
        else return max(P(i+1,j),P(i,j+1));
    }
    return 0;
}
int main()
{
    cin>>n>>m;
    for(int i=1;i<=n;i++) cin>>A[i];
    for(int j=1;j<=m;++j) cin>>B[j];
    cout<<P(1,1);
    return 0;
}