Cod sursa(job #808712)

Utilizator gegeadDragos Gegea gegead Data 7 noiembrie 2012 10:01:38
Problema Cel mai lung subsir comun Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.92 kb
#include<cstdio>
int a[1025],b[1025],d[1025][1025],v[10250];



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



int lcs(int x, int y)
{
    if(x==0||y==0)
        return 0;
    if(a[x]==b[y])
        return d[x-1][y-1]+1;
    return max(d[x][y-1],d[x-1][y]);
}


int main()
{
    freopen("cmlsc.in","r",stdin);
    freopen("cmlsc.out","w",stdout);
    int n,m,i,j;
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;++i)
        scanf("%d",&a[i]);
    for(i=1;i<=m;++i)
        scanf("%d",&b[i]);
    for(i=1;i<=n;++i)
        for(j=1;j<=m;++j)
            d[i][j]=lcs(i,j);
    for (i = n, j = m; i; )
        if (a[i] == b[j])
            v[++v[0]] = a[i], --i, --j;
        else
            if (d[i-1][j] < d[i][j-1])
                --j;
            else
                --i;
    printf("%d\n",d[n][m]);
    for(i=v[0];i>=1;--i)
        printf("%d ",v[i]);
    return 0;
}