Cod sursa(job #1791220)

Utilizator raulrusu99Raul Rusu raulrusu99 Data 29 octombrie 2016 10:56:12
Problema Cel mai lung subsir comun Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.87 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
#define MAX_N 1050
int a[MAX_N],b[MAX_N];
int n,m,l;
int lmax[MAX_N][MAX_N],comun[MAX_N];
int maxx=-1;
void rec()
{
    for(int j=1;j<=m;j++)
    {
        for(int i=1;i<=n;i++)
        {
            if(a[i]==b[j])
            {
                lmax[i][j]=lmax[i-1][j-1]+1;
                l++;
                comun[l]=a[i];
            }
            else
                lmax[i][j]=lmax[i-1][j-1];
            lmax[i][j]=max(lmax[i][j],max(lmax[i-1][j],lmax[i][j-1]));
            maxx=max(maxx,lmax[i][j]);
        }
    }
}
int main()
{
    f>>n>>m;
    for(int i=1;i<=n;i++)
        f>>a[i];
    for(int i=1;i<=m;i++)
        f>>b[i];
    rec();
    g<<maxx<<"\n";
    for(int i=1;i<=l;i++)
        g<<comun[i]<<" ";
    return 0;
}