Cod sursa(job #2152329)

Utilizator MarianConstantinMarian Constantin MarianConstantin Data 5 martie 2018 13:58:31
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.21 kb
#include <iostream>
#include <fstream>

using namespace std;

int a[1250], b[1250], c[1250][1250], n, m, d[1250], x=0;

void completare()
{
    for (int i=1; i<=n; i++)
        if (a[i]==b[1])
            c[1][i]=1+c[1][i-1];
        else
            c[1][i]=c[1][i-1];
    for (int i=1; i<=m; i++)
        if (a[1]==b[i])
            c[i][1]=1+c[i-1][1];
        else
            c[i][1]=c[i-1][1];
    for (int i=1; i<=n; i++)
        for (int j=1; j<=m; j++)
            if (a[i]==b[j])
            {
                d[x++]=a[i];
                c[i][j]=c[i-1][j-1]+1;
            }
            else
                if (c[i][j-1]>c[i-1][j])
                    c[i][j]=c[i][j-1];
                else
                    c[i][j]=c[i-1][j];
}

int main()
{
    ifstream fin("cmlsc.in");
    ofstream fout("cmlsc.out");
    fin >> n >> m;
    for (int i=1; i<=n; i++)
        fin >> a[i];
    for (int j=1; j<=m; j++)
        fin >> b[j];
    completare();
    /*for (int i=1; i<=n; i++)
    {
        for (int j=1; j<=m; j++)
            fout << c[i][j] << " ";
        fout << "\n";
    }*/
    fout << x << "\n";
    for (int i=0; i<x; i++)
        fout << d[i] << " ";
    return 0;
}