Cod sursa(job #1492402)

Utilizator ADragos... ... ADragos Data 27 septembrie 2015 17:41:37
Problema Cel mai lung subsir comun Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.79 kb
#include <fstream>
#include <iostream>
using namespace std;
int x,y,i,j,len;
int C[1024][1024],a[1024],b[1024];
int main()
{
    ifstream intrare ("cmlsc.in");
    ofstream iesire ("cmlsc.out");
    intrare>>x>>y;
    for (i=1; i<=x; i++)
    {
        intrare>>a[i];
    }
    for (i=1; i<=y; i++)
    {
        intrare>>b[i];
    }
    for (i=1;i<=x;i++)
        for (j=1;j<=y;j++)
        {
            if (a[i]==b[j]) C[i][j]=C[i-1][j-1]+1;
            else C[i][j]=(C[i-1][j]>C[i][j-1] ? C[i-1][j]:C[i][j-1]);
        }
    len=C[x][y];
    iesire<<len<<endl;
    int k=0;
    while (k<len)
    {
        for (i=1;i<=x;i++)
            for (j=1;j<=y;j++)
            {
                if (a[i]==b[j]) {iesire<<a[i]<<" ";k++;}
            }
    }
    return 0;
}