Cod sursa(job #2648338)

Utilizator OrosIacobOros Iacob OrosIacob Data 10 septembrie 2020 12:27:29
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.8 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int d[10][10],n,m,a[1025],b[1025];

void afisare(int i, int j)
{
    if (d[i][j]==0)
        return;
    if (a[i]==b[j])
    {
        afisare(i-1,j-1);
        g<<a[i]<<" ";
        return;
    }
    if (d[i-1][j] > d[i][j-1])
        afisare(i-1,j);
    else
        afisare(i,j-1);
}

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

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

    g<<d[n][m]<<'\n';

   afisare(n,m);



    return 0;
}