Cod sursa(job #2439584)

Utilizator alexandrapricopAlexandra Pricop alexandrapricop Data 16 iulie 2019 14:16:47
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.08 kb
#include <bits/stdc++.h>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int n,m,sol[1025][1025],a[1025],b[1025],vec[1025],k,nr;
int main()
{
    fin>>n>>m;
    sol[0][0]=0;
    for(int i=1; i<=n; i++){
        fin>>a[i];
        sol[0][i]=0;}
    for(int i=1; i<=m; i++){
        fin>>b[i];
        sol[i][0]=0;}


    for(int i=1; i<=n; i++)
    for(int j=1; j<=m; j++){
        if(a[i]==b[j]){
            sol[i][j]=sol[i-1][j-1]+1;
            nr++;
        }
        else{
            if(sol[i-1][j]>sol[i][j-1])
                sol[i][j]=sol[i-1][j];
            else
                sol[i][j]=sol[i][j-1];
        }
    }
    int cnr=nr;
    for(int i=n; i>0; )
        for(int j=m; j>0; ){
            if(a[i]==b[j]){
                vec[nr--]=a[i];
                --i;
                --j;}
            else if(sol[i-1][j]>sol[i][j-1])
                --i;
            else
                --j;
        }

    cout<<nr;
    fout<<cnr<<'\n';

    for(int j=1; j<=cnr; j++)
        fout<<vec[j]<<" ";


    return 0;
}