Cod sursa(job #2846255)

Utilizator dolorentiuDaniel Gadalean dolorentiu Data 9 februarie 2022 00:32:56
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.83 kb
#include <bits/stdc++.h>
using namespace std;

ifstream f("cmlsc.in");
ofstream g("cmlsc.out");

int maxim(int a,int b){
    if(a>b)return a;
    else return b;
}
int main()
{
    int A[1025],B[1025],C[105][105]={0},D[1025]={0},M,N;
    f>>M>>N;
    for(int i=1;i<=M;i++)
        f>>A[i];
    for(int i=1;i<=N;i++)
        f>>B[i];
    for(int i=1;i<=M;i++)
        for(int j=1;j<=N;j++)
            if(A[i]==B[j])
                C[i][j]=1+C[i-1][j-1];
            else
                C[i][j]=maxim(C[i-1][j],C[i][j-1]);
    int i=M,j=N,m=0;
    while(j){
        if(A[i]==B[j]){
            D[++m]=A[i];
            i--;
            j--;
        }else if(C[i-1][j]<C[i][j-1])
            j--;
        else
            i--;
    }
    g<<m<<'\n';
    for(int i=m;i>=1;i--)
        g<<D[i]<<" ";
    return 0;
}