Cod sursa(job #2290246)

Utilizator Pop_EmilPal Tamas Pop_Emil Data 26 noiembrie 2018 09:06:08
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.25 kb
#include <stdio.h>

FILE *in = fopen("cmlsc.in","r");
FILE *out = fopen("cmlsc.out","w");

int N, M;

int X[1029], Y[1029];
int D[1029][1029];
int Sub[1029];

void _read()
{
    fscanf(in, "%d %d", &N, &M);

    for(int i=1; i<=N; ++i)
    {
        fscanf(in, "%d", &X[i]);
    }

    for(int i=1; i<=M; ++i)
    {
        fscanf(in, "%d", &Y[i]);
    }
}

/*
    1 - left
    2 - up/left
    3 - up
*/
int main()
{
    _read();

    for(int j=0; j<=M; ++j)
        D[0][j] = 0;

    for(int i=1; i<=N; ++i)
    {
        D[i][0] = 0;

        for(int j=1; j<=M; ++j)
        {
            if(X[i]==Y[j])
                D[i][j] = 2;
            else
            {
                if(D[i-1][j] < D[i][j-1])
                    D[i][j] = 1;
                else
                    D[i][j] = 3;
            }
        }
    }


    int i = N, j = M;
    int len = 0;

    while(i > 0 && j > 0)
    {
        switch(D[i][j])
        {
            case 1: --j; break;
            case 2: Sub[len] = X[i]; ++len; --i; --j; break;
            case 3: --i; break;
        }
    }

    fprintf(out, "%d\n", len);
    for(int i=len-1; i>=0; --i)
    {
        fprintf(out, "%d ", Sub[i]);
    }

    return 0;
}