Cod sursa(job #2956617)

Utilizator TheEpicWipedCreaVlad Chirita Alexandru TheEpicWipedCrea Data 19 decembrie 2022 21:38:34
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1 kb
#include <bits/stdc++.h>

using namespace std;
ifstream in  ("cmscl.in");
ofstream out("cmscl.out");

#define maxN 1024

int a[maxN+1];
int b[maxN+1];
int d[maxN+1][maxN+1];
int v[maxN*maxN+1];

int main(){
    int n,m;
    in>>n>>m;
    for(int i=1;i<=n;i++){
        in>>a[i];
    }
    for(int i=1;i<=m;i++){
        in>>b[i];
    }
    d[0][0]=0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            if(a[i]==b[j]){
                d[i][j]=d[i-1][j-1]+1;
            }
            else{
                d[i][j]=max(d[i-1][j],d[i][j-1]);
            }
        }
    }

    int maxi=d[n][m];
    int i=n,j=m;

    while(maxi>=1){
        if(d[i-1][j]==maxi){
            i--;
        }
        else if(d[i][j-1]==maxi){
            j--;
        }
        else{
            v[maxi]=a[i];
            i--;
            j--;
            maxi--;
        }
    }

    out<<d[n][m]<<'\n';
    for(i=1;i<=d[n][m];i++){
        out<<v[i]<<" ";
    }
}