Cod sursa(job #1342115)

Utilizator Seb16Ungureanu Paul Sebastian Seb16 Data 13 februarie 2015 15:39:08
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.97 kb
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int a[1025], b[1025], c[1025][1025], v[1025];
int m, n, i, j,k;
int main()
{
    fin>>m>>n;
    for(j=1;j<=m;j++)
    {
        fin>>a[j];
    }
    for(i=1;i<=n;i++)
    {
        fin>>b[i];
    }
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        {
            c[i][j]=max(c[i-1][j], c[i][j-1]);
            if(a[j]==b[i])
            {
                c[i][j]++;
            }
        }
    }
    j=m; i=n;
    k=1;
    while(j!=1&&i!=1)
    {
        if(c[i][j]==c[i-1][j-1]+1)
        {
            v[k]=a[j];
            i--;
            k++;
        }
        else if (c[i-1][j]>c[i][j-1])
        {
            i--;
        }
        else
        {
            j--;
        }
    }
    k--;
    fout<<k<<'\n';
    for(i=k;i>=1;i--)
    {
        fout<<v[i]<<' ';
    }
    fin.close();
    fout.close();
}