Cod sursa(job #1999891)

Utilizator lupulescu2001Lupulescu Vlad lupulescu2001 Data 12 iulie 2017 12:41:49
Problema Cel mai lung subsir comun Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1 kb
#include<fstream>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int a[1027][1027],v[1027],x[1027],raspuns[1027];
int main()
{
    int i,j,n,m,k,lin,col,ok;
    fin>>n>>m;
    for(i=1; i<=n; i++)
        fin>>v[i];
    for(i=1; i<=m; i++)
        fin>>x[i];
    for(i=1; i<=m; i++)
        for(j=1; j<=n; j++)
            if(v[j]==x[i])
                a[i][j]=a[i-1][j-1]+1;
            else
                a[i][j]=max(a[i-1][j],a[i][j-1]);
    fout<<a[m][n]<<'\n';
    k=a[m][n];
    lin=m;
    col=n;
    while(k)
    {
        ok=0;
        for(i=1; i<=lin; i++)
        {
            for(j=1; j<=col; j++)
                if(a[i][j]==k)
                {
                    ok=1;
                    k--;
                    lin=i;
                    col=j;
                    raspuns[a[m][n]-k]=x[i];
                }
            if(ok==1)
                break;
        }

    }
    for(i=a[m][n];i>=1;i--)
        fout<<raspuns[i]<<" ";


}