Cod sursa(job #3303185)

Utilizator alexbaldovin20alex baldovin alexbaldovin20 Data 14 iulie 2025 15:53:58
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.78 kb
#include <bits/stdc++.h>

using namespace std;

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

int a[1026],b[1026],f[1026];
int n,m,i,j,sj,maxim,msj;
int main() {
    in>>n>>m;
    if(n<m) {
        for (i=1;i<=n;i++)
            in>>b[i];
        for (i=1;i<=m;i++)
            in>>a[i];
        swap(n,m);
    }
    else {
        for (i=1;i<=n;i++)
            in>>a[i];
        for (i=1;i<=m;i++)
            in>>b[i];
    }
    i=1;
    sj=1;
    while (i<=n) {
        for (j=sj;j<=m;j++) {
            if (a[i]==b[j]) {
                sj=j;
                f[i]++;
            }
        }
        f[i]+=f[i-1];
        i++;
    }
    out<<f[n]<<"\n";
    for (i=1;i<=n;i++)
        if (f[i]!=f[i-1])
            out<<a[i]<<" ";
    return 0;
}