Cod sursa(job #2154097)

Utilizator tigeraOprea Tereza Emilia tigera Data 6 martie 2018 18:26:58
Problema Cel mai lung subsir comun Scor 10
Compilator cpp Status done
Runda Arhiva educationala Marime 0.91 kb
#include <fstream>

using namespace std;

ifstream fin ("cmlsc.in");
ofstream fout ("cmlsc.out");

int a[1030],b[1030],ans[1030];
int m,n,v[1030][1030],i,j,val,x,y;

int main ()
{
    fin>>n>>m;
    for(i=1;i<=n;i++)
        fin>>a[i];
    for(i=1;i<=m;i++)
        fin>>b[i];
    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
            if(a[i]==b[j])
                v[i][j]=max(v[i-1][j],v[i][j-1])+1;
            else
                v[i][j]=max(v[i-1][j],v[i][j-1]);
    fout<<v[n][m]<<'\n';
    val=v[n][m];
    x=n; y=m;
    while(val>0)
    {
        while(v[x-1][y]==val)
            x--;
        while(v[x][y-1]==val)
            y--;
        ans[val]=a[x];
        x--; y--;
        val--;
    }
    for(i=1;i<=v[n][m];i++)
        fout<<ans[i]<<' ';
    /*
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
            fout<<v[i][j]<<' ';
        fout<<'\n';
    }
    */
}