Cod sursa(job #3339094)

Utilizator alexbaldovin20alex baldovin alexbaldovin20 Data 6 februarie 2026 11:27:15
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.02 kb
#include <bits/stdc++.h>
using namespace std;

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

int a[1030],b[1030];
int dp[1030][1030];
int c[1030];
int k;
int main() {

    ios_base::sync_with_stdio(false);
    in.tie(NULL);

    int n,m;
    cin>>n>>m;
    for (int i=1;i<=n;i++) {
        cin>>a[i];
    }
    for (int i=1;i<=m;i++) {
        cin>>b[i];
    }

    for (int i=1;i<=n;i++) {
        for (int j=1;j<=m;j++) {
            if (a[i]==b[j]) {
                dp[i][j]=dp[i-1][j-1]+1;
            }
            else {
                dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
            }
        }
    }

    cout<<dp[n][m]<<"\n";

    int i=n;
    int j=m;

    while (i>=1 and j>=1) {
        if (a[i]==b[j]) {
            c[++k]=a[i];
            i--;
            j--;
        }
        else {
            if (dp[i][j-1]>=dp[i-1][j])
                j--;
            else
                i--;
        }
    }
    for (int i=k;i>=1;i--) {
        cout<<c[i]<<" ";
    }
}