Cod sursa(job #1733263)

Utilizator Tudor_CandeaCandea Tudor Tudor_Candea Data 24 iulie 2016 11:01:53
Problema Cel mai lung subsir comun Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 0.9 kb
#include <stdio.h>

#define maxi(x, z) ((x > z) ? x : z)
#define z 1024

int m, n, k=0, a[z], b[z], c[z][z], d[z];
int main(void)
{
    freopen("cmlsc.in", "r", stdin);
    freopen("cmlsc.out", "w", stdout);

    int   i, j;
    scanf("%d %d", &n, &m);
    for(i=1;i<=n;i++)
        scanf("%d", &a[i]);

    for(j=1;j<=m;j++)
        scanf("%d", &b[j]);

    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
        {
            if(a[i]==b[j])
                c[i][j]=c[i-1][j-1]+1;

            else
                c[i][j]=maxi(c[i-1][j],c[i][j-1]);
        }

    for (j=m,i=n; i; )
    {
        if(a[i]==b[j])
        {
            d[++k]=a[i];
            --i;
            --j;
        }
        else if(c[i-1][j]<c[i][j-1])
            --j;
        else
            --i;
    }

    printf("%d\n", k);
    for(int l=k;l>0;l--)
        printf("%d ", d[l]);

    return 0;
}