Cod sursa(job #155977)

Utilizator M@2Te4iMatei Misarca M@2Te4i Data 12 martie 2008 11:57:50
Problema Cel mai lung subsir comun Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 1.03 kb
#include <cstdio>
#define vv 1025

using namespace std;

int a[vv],b[vv],w[vv][vv],m,n,q=0;

void citire()
{
    freopen("cmlsc.in","r",stdin);
    scanf("%d%d", &n, &m);
    int i;
    for (i=1; i<=n; i++)
	scanf("%d", &a[i]);
    for (i=1; i<=m; i++)
        scanf("%d", &b[i]);
    fclose(stdin);
}

int max(int w,int q)
{
if (w>q)
   return w;
return q;
}

void subsir_comun_maximal()
{
    for (int i=1; i<=n; i++)
        for (int j=1; j<=m; j++)
            if (a[i]==b[j])
                w[i][j]=1+w[i-1][j-1];
            else
                w[i][j]=max(w[i-1][j],w[i][j-1]);
}

void afisare(int q, int e)
{
    for (int i=e; i>0; i--)
        if (w[q-1][i-1]+1==w[q][i] && w[q][i]>0 && w[q][i-1]<w[q][i])
        {
            afisare(q-1, i-1);
            printf("%d ",b[i]);
            break;
        }
}

int main()
{
    citire();
    subsir_comun_maximal();
    freopen("cmlsc.out","w",stdout);
    printf("%d\n", w[n][m]);
    afisare(n,m);
    fclose(stdout);
    return 0;
}