Cod sursa(job #1929795)

Utilizator DascaluAndreiDascalu Andrei DascaluAndrei Data 18 martie 2017 10:24:18
Problema Cel mai lung subsir comun Scor 10
Compilator cpp Status done
Runda Arhiva educationala Marime 0.83 kb
#include <bits/stdc++.h>

using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int n,m,i,j;
int a[1030],b[1030],LCS[1030][1030];
int v[1030];
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])
                LCS[i][j]=LCS[i-1][j-1]+1;
            else
                LCS[i][j]=max(LCS[i-1][j],LCS[i][j-1]);
        }
    }
    fout<<LCS[n][m]<<'\n';
    int ct=0;
    i=n; j=m;
    while(i>0&&j>0)
    {
        if(LCS[i][j]==LCS[i-1][j-1]+1)
            v[++ct]=a[i],i--,j--;
        if(LCS[i][j-1]>LCS[i-1][j])
            j--;
        else
            i--;
    }
    for(i=LCS[n][m];i>=1;--i)
        fout<<v[i]<<' ';
    return 0;
}