Cod sursa(job #819218)

Utilizator YoYoxxIftimesei Ioan YoYoxx Data 18 noiembrie 2012 18:03:38
Problema Cel mai lung subsir comun Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 1.1 kb
#include <fstream>
using namespace std;
ifstream in ("cmlsc.in");
ofstream out ("cmlsc.out");
int x[1025];
int x2[1025];
int mat[1025][1025];

void citire (int a,int b)
{
    int i,j;
    for (i=1;i<=a;i++)
    {
        in>>x[i];
    }
    for (i=1;i<=b;i++)
    {
        in>>x2[i];
    }
}


void rezolvare (int a,int b)
{
    int i,j;
    for (i=1;i<=a;i++)
    {
        for(j=1;j<=b;j++)
        {
            if (x[i]==x2[j]) mat[i][j]=mat[i-1][j-1]+1;
            else if (x[i]!=x2[j]) mat[i][j]=max(mat[i-1][j],mat[i][j-1]);
        }
    }


}

int max(int a,int b)
{
    if (a>b) return a;
    if (b>a) return b;
    if (a==b) return a;


}



void afisare(int a,int b)
{
    int i,j,k=1;
    for (i=1;i<=a;i++)
    {
        for (j=1;j<=b;j++)
        {
            if (mat[i][j]==k&&x[i]==x2[j])
            {
            out<<x[i]<<" ";

                k=k+1;
            }
        }
    }


}


int main()
{
   int a,b;
   in>>a>>b;

   citire (a,b);
   rezolvare(a,b);
   out<<mat[a][b]<<"\n";

   afisare (a,b);


return 0;
}