Cod sursa(job #2374213)

Utilizator victorzarzuZarzu Victor victorzarzu Data 7 martie 2019 17:30:52
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.87 kb
#include <bits/stdc++.h>

using namespace std;
int n,m,x[1025],y[2015],a[1025][1025],v[1025];
ifstream f("cmlsc.in");
ofstream g("smlsc.out");
void citire()
{
    f>>n>>m;
    for(int i=1;i<=n;++i)
        f>>x[i];
    for(int j=1;j<=m;++j)
        f>>y[j];
}
void dinamica()
{
    for(int i=1;i<=n;++i)
        for(int j=1;j<=m;++j)
            if(x[i]==y[j]) a[i][j]=a[i-1][j-1]+1;
            else a[i][j]=max(a[i-1][j],a[i][j-1]);
    g<<a[n][m]<<'\n';
}
void afisare(int i,int j)
{
    int k=0;
    while(i>0 && j>0)
    {
        if(x[i]==y[j])
        {
            v[++k]=x[i];
            --i;
            --j;
        }
        else if(a[i][j]==a[i-1][j]) --i;
        else if(a[i][j]==a[i][j-1]) --j;
    }
    for(int i=k;i>=1;--i)
        g<<v[i]<<" ";
}
int main()
{
    citire();
    dinamica();
    afisare(n,m);
    return 0;
}