Cod sursa(job #968130)

Utilizator gbi250Gabriela Moldovan gbi250 Data 1 iulie 2013 20:27:37
Problema Cel mai lung subsir comun Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 0.86 kb
#include <cstdio>
using namespace std;
int m, n, a[1025], b[1025], i, j, l[1025][1025], k, v[1024];
int main()
{
    freopen("cmlsc.in", "r", stdin);
    freopen("cmlsc.out", "w", stdout);
    scanf("%d %d", &m, &n);
    for(i=1;i<=m;i++)
        scanf("%d", &a[i]);
    for(i=1;i<=n;i++)
        scanf("%d", &b[i]);
    for(i=1;i<=m;i++)
        for(j=1;j<=n;j++)
            if(a[i]==b[j])
                l[i][j]=l[i-1][j-1]+1;
            else if(l[i-1][j]>l[i][j-1])
                l[i][j]=l[i-1][j];
            else l[i][j]=l[i][j-1];
    printf("%d\n", l[m][n]);
    i=m; j=n;
    while(i>=1&&j>=1)
    {
        if(a[i]==b[j])
        {
            v[k++]=a[i];
            i--; j--;
        }
        else if(i>=2&&l[i-1][j]==l[i][j])
            i--;
        else if(j>=2)
            j--;
    }
    for(i=k-1;i>=0;i--)
        printf("%d ", v[i]);
    return 0;
}