Cod sursa(job #2200481)

Utilizator gagasergiugaga sergiu gagasergiu Data 1 mai 2018 16:06:17
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.72 kb
#include <iostream>
#include <fstream>
#define maxim(a, b) ((a > b) ? a : b)
#define NMax 1024
using namespace std;

int M,N,A[NMax],B[NMax],D[NMax][NMax],i,j,sir[NMax],nr;
int main()
{
    ifstream f("cmlsc.in");
    ofstream g("cmlsc.out");
    f>>M>>N;
    for(i=1;i<=M;i++)
        f>>A[i];
    for(i=1;i<=N;i++)
    f>>B[i];
    for(i=1;i<=M;i++)
        for(j=1;j<=N;j++)
    {
        if(A[i]==B[j])D[i][j]=1+D[i-1][j-1];
        else D[i][j]=maxim(D[i-1][j],D[i][j-1]);
    }i=M;j=N;
    while(i!=0 or j!=0)
    {
        if(A[i]==B[j])
            {sir[nr++]=A[i];i--;j--;}
        else if(D[i-1][j]<D[i][j-1])j--;
        else i--;
    }g<<nr<<endl;
    for(i=nr;i>=1;i--)
        g<<sir[i]<< " ";
}