Cod sursa(job #2930151)

Utilizator carinamariaCarina Maria Viespescu carinamaria Data 27 octombrie 2022 16:39:34
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.85 kb
#include <fstream>
using namespace std;
ifstream cin("cmlsc.in");
ofstream cout("cmlsc.out");
int i, j, n, m, k;
int d[1030][1030], a[1030], b[1030], v[1030];
int main() {
    cin>>n>>m;
    for(i=1;i<=n;i++){
        cin>>a[i];
    }
    for(j=1;j<=m;j++){
        cin>>b[j];
    }
    for(i=1;i<=n;i++){
        for(j=1;j<=m;j++){
            if(a[i-1]==b[j-1])
                d[i][j]=d[i-1][j-1]+1;
            else
                d[i][j]=max(d[i][j-1], d[i-1][j]);
        }
    }
    cout<<d[n][m]<<"\n";
    i=n;
    j=m;
    while(i>=1 && j>=1){
        if(a[i]==b[j]){
            v[++k]=a[i];
            i--;
            j--;
        }
        else{
            if(d[i-1][j]>d[i][j-1])
                i--;
            else
                j--;
        }
    }
    for(i=k;i>=1;i--)
        cout<<v[i]<<" ";


}