Cod sursa(job #2180192)

Utilizator lucianrusu00Rusu Lucian lucianrusu00 Data 20 martie 2018 18:11:35
Problema Cel mai lung subsir comun Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 1.06 kb
#include <iostream>
#include <fstream>

using namespace std;

ifstream f("cmlsc.in");
ofstream g("cmlsc.out");

int n,m,a[1025],b[1025],harta[1025][1025];

void citire()
{
    f>>n>>m;
    for(int i=1;i<=n;i++)
        f>>a[i];
    for(int i=1;i<=m;i++)
        f>>b[i];
}

void afisare()
{
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
            g<<harta[i][j]<<" ";
        g<<'\n';
    }
    g<<'\n';
}

void cmlsc()
{
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            if(a[i]==b[j])
                harta[i][j]=harta[i-1][j-1]+1;
            else
                harta[i][j]=max(harta[i-1][j],harta[i][j-1]);
        }
        //afisare();
    }
}

void afisared()
{
    int Max=0;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            if(harta[i][j]>Max)
            {
                g<<a[i]<<" ";
                Max=harta[i][j];
            }
}

int main()
{
    citire();
    cmlsc();
    g<<harta[n][m]<<'\n';
    afisared();
    return 0;
}