Cod sursa(job #966911)

Utilizator httpsLup Vasile https Data 26 iunie 2013 19:18:45
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.71 kb
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
short a[1025],b[1025],m,n,j,i;
int d[1025][1025];
int main()
{
    f>>n>>m;
    for(i=1;i<=n;i++,f>>a[i]);
    for(i=1;i<=m;i++,f>>b[i]);
    for (i=1;i<=n;i++)
        for (j=1;j<=m;j++)
        {
            if (a[i]==b[j])
                    d[i][j]=d[i-1][j-1]+1;
            else d[i][j]=max(d[i-1][j],d[i][j-1]);
        }
    g<<d[n][m]<<"\n";
    int l(0),sir[1025];
    for (i=n,j=m;i;)
    {
        if (a[i]==b[j]) sir[++l]=a[i],--i,--j;
        else if (d[i-1][j]<d[i][j-1]) --j;
        else --i;
    }g<<l<<"\n";
    for (i=l;i;i--) g<<sir[i]<<" ";
    g.close();
return 0;
}