Cod sursa(job #2221141)

Utilizator stefanut999Paul Colta stefanut999 Data 13 iulie 2018 11:49:48
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.82 kb
#include <fstream>
std::ifstream cin("cmlsc.in");
std::ofstream cout("cmlsc.out");
#define maxim(a, b) ((a > b) ? a : b)
using namespace std;

int main()
{   int M,N,k=0,v[1025][1025],a[1025],b[1025],i,j,sir[1025];
    cin>>M>>N;
    for(i=1; i<=M; i++)
        cin>>a[i];
    for(i=1; i<=N; i++)
        cin>>b[i];
    for(i=1; i<=M; i++)
        for(j=1; j<=N; j++)
            if(a[i]==b[j])
                v[i][j]=1+v[i-1][j-1];
            else
                v[i][j]=maxim(v[i-1][j],v[i][j-1]);

    for(i=M, j=N; i>0, j>0; )
        if(a[i]==b[j])
          {sir[++k]=a[i];
            i--; j--;}
        else
            if(v[i-1][j]<v[i][j-1])
                j--;
            else
                i--;
    cout<<k<<'\n';
    for(i=N; i>0; i--)
        cout<<sir[i]<<" ";
    return 0;
}